./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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.5.800.v20200727-1323.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/openssl/s3_srvr.blast.06.i.cil-1.c -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 6fd3beed33795904cd1581dde522a699edf165ce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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.5.800.v20200727-1323.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/openssl/s3_srvr.blast.06.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6fd3beed33795904cd1581dde522a699edf165ce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:22:28,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:22:28,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:22:28,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:22:28,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:22:28,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:22:28,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:22:28,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:22:28,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:22:28,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:22:28,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:22:28,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:22:28,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:22:28,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:22:28,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:22:28,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:22:28,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:22:28,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:22:28,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:22:28,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:22:28,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:22:28,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:22:28,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:22:28,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:22:28,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:22:28,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:22:28,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:22:28,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:22:28,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:22:28,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:22:28,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:22:28,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:22:28,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:22:28,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:22:28,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:22:28,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:22:28,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:22:28,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:22:28,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:22:28,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:22:28,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:22:28,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:22:28,149 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:22:28,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:22:28,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:22:28,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:22:28,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:22:28,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:22:28,152 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:22:28,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:22:28,152 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:22:28,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:22:28,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:22:28,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:22:28,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:22:28,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:22:28,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:22:28,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:22:28,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:28,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:22:28,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:22:28,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6fd3beed33795904cd1581dde522a699edf165ce [2021-08-25 20:22:28,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:22:28,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:22:28,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:22:28,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:22:28,411 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:22:28,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:22:28,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39913c4a9/9fc153dd83414f9f9f9bee2f86c6f7a7/FLAG7156c59e7 [2021-08-25 20:22:28,897 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:22:28,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:22:28,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39913c4a9/9fc153dd83414f9f9f9bee2f86c6f7a7/FLAG7156c59e7 [2021-08-25 20:22:28,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39913c4a9/9fc153dd83414f9f9f9bee2f86c6f7a7 [2021-08-25 20:22:28,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:22:28,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:22:28,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:28,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:22:28,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:22:28,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:28" (1/1) ... [2021-08-25 20:22:28,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259d031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:28, skipping insertion in model container [2021-08-25 20:22:28,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:22:28" (1/1) ... [2021-08-25 20:22:28,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:22:28,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:22:29,250 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] [2021-08-25 20:22:29,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:29,264 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:22:29,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] [2021-08-25 20:22:29,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:22:29,342 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:22:29,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29 WrapperNode [2021-08-25 20:22:29,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:22:29,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:29,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:22:29,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:22:29,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:22:29,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:22:29,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:22:29,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:22:29,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:22:29,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:22:29,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:22:29,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:22:29,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (1/1) ... [2021-08-25 20:22:29,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:22:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:22:29,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:22:29,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:22:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:22:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:22:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:22:29,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:22:29,786 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:22:30,347 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:22:30,347 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:22:30,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:22:30,353 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:22:30,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:30 BoogieIcfgContainer [2021-08-25 20:22:30,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:22:30,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:22:30,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:22:30,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:22:30,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:22:28" (1/3) ... [2021-08-25 20:22:30,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dada75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:30, skipping insertion in model container [2021-08-25 20:22:30,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:22:29" (2/3) ... [2021-08-25 20:22:30,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dada75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:22:30, skipping insertion in model container [2021-08-25 20:22:30,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:22:30" (3/3) ... [2021-08-25 20:22:30,359 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:22:30,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:22:30,363 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:22:30,393 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:22:30,397 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:22:30,397 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:22:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 157 states have (on average 1.7388535031847134) internal successors, (273), 158 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:22:30,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:30,415 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:30,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889119, now seen corresponding path program 1 times [2021-08-25 20:22:30,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:30,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039584663] [2021-08-25 20:22:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:30,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:30,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:30,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039584663] [2021-08-25 20:22:30,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039584663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:30,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:30,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:30,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692215995] [2021-08-25 20:22:30,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:30,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:30,704 INFO L87 Difference]: Start difference. First operand has 159 states, 157 states have (on average 1.7388535031847134) internal successors, (273), 158 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:31,017 INFO L93 Difference]: Finished difference Result 345 states and 591 transitions. [2021-08-25 20:22:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:22:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:31,024 INFO L225 Difference]: With dead ends: 345 [2021-08-25 20:22:31,024 INFO L226 Difference]: Without dead ends: 174 [2021-08-25 20:22:31,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-25 20:22:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2021-08-25 20:22:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5897435897435896) internal successors, (248), 156 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2021-08-25 20:22:31,051 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 44 [2021-08-25 20:22:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:31,052 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2021-08-25 20:22:31,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2021-08-25 20:22:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:22:31,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:31,053 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:31,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:22:31,054 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash -829622597, now seen corresponding path program 1 times [2021-08-25 20:22:31,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:31,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952232975] [2021-08-25 20:22:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:31,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:31,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:31,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952232975] [2021-08-25 20:22:31,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952232975] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:31,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:31,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:31,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679861377] [2021-08-25 20:22:31,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:31,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:31,125 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:31,362 INFO L93 Difference]: Finished difference Result 312 states and 487 transitions. [2021-08-25 20:22:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:31,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:22:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:31,363 INFO L225 Difference]: With dead ends: 312 [2021-08-25 20:22:31,363 INFO L226 Difference]: Without dead ends: 174 [2021-08-25 20:22:31,364 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-25 20:22:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2021-08-25 20:22:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5833333333333333) internal successors, (247), 156 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2021-08-25 20:22:31,371 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 57 [2021-08-25 20:22:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:31,371 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2021-08-25 20:22:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2021-08-25 20:22:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:22:31,372 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:31,373 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:31,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:22:31,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash -44447127, now seen corresponding path program 1 times [2021-08-25 20:22:31,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:31,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389710305] [2021-08-25 20:22:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:31,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:31,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:31,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389710305] [2021-08-25 20:22:31,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389710305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:31,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:31,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:31,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685925602] [2021-08-25 20:22:31,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:31,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:31,431 INFO L87 Difference]: Start difference. First operand 157 states and 247 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:31,694 INFO L93 Difference]: Finished difference Result 311 states and 485 transitions. [2021-08-25 20:22:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:22:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:31,695 INFO L225 Difference]: With dead ends: 311 [2021-08-25 20:22:31,695 INFO L226 Difference]: Without dead ends: 173 [2021-08-25 20:22:31,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-25 20:22:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2021-08-25 20:22:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5769230769230769) internal successors, (246), 156 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2021-08-25 20:22:31,701 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 58 [2021-08-25 20:22:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:31,701 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2021-08-25 20:22:31,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2021-08-25 20:22:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:22:31,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:31,702 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:31,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:22:31,702 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1118306, now seen corresponding path program 1 times [2021-08-25 20:22:31,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:31,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880918222] [2021-08-25 20:22:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:31,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:31,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:31,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880918222] [2021-08-25 20:22:31,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880918222] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:31,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:31,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:31,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369111347] [2021-08-25 20:22:31,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:31,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:31,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:31,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:31,789 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,012 INFO L93 Difference]: Finished difference Result 309 states and 482 transitions. [2021-08-25 20:22:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:22:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,014 INFO L225 Difference]: With dead ends: 309 [2021-08-25 20:22:32,014 INFO L226 Difference]: Without dead ends: 171 [2021-08-25 20:22:32,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-25 20:22:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2021-08-25 20:22:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5705128205128205) internal successors, (245), 156 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2021-08-25 20:22:32,019 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 58 [2021-08-25 20:22:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,019 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2021-08-25 20:22:32,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2021-08-25 20:22:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:22:32,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,020 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:22:32,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1969168478, now seen corresponding path program 1 times [2021-08-25 20:22:32,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272977567] [2021-08-25 20:22:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:32,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272977567] [2021-08-25 20:22:32,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272977567] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196528756] [2021-08-25 20:22:32,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,093 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,292 INFO L93 Difference]: Finished difference Result 308 states and 480 transitions. [2021-08-25 20:22:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:22:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,293 INFO L225 Difference]: With dead ends: 308 [2021-08-25 20:22:32,293 INFO L226 Difference]: Without dead ends: 170 [2021-08-25 20:22:32,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-25 20:22:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-25 20:22:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.564102564102564) internal successors, (244), 156 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 244 transitions. [2021-08-25 20:22:32,297 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 244 transitions. Word has length 58 [2021-08-25 20:22:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,298 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 244 transitions. [2021-08-25 20:22:32,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 244 transitions. [2021-08-25 20:22:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:22:32,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,298 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:22:32,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1679982507, now seen corresponding path program 1 times [2021-08-25 20:22:32,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287371085] [2021-08-25 20:22:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:32,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287371085] [2021-08-25 20:22:32,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287371085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509323788] [2021-08-25 20:22:32,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,336 INFO L87 Difference]: Start difference. First operand 157 states and 244 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,530 INFO L93 Difference]: Finished difference Result 308 states and 479 transitions. [2021-08-25 20:22:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:22:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,531 INFO L225 Difference]: With dead ends: 308 [2021-08-25 20:22:32,531 INFO L226 Difference]: Without dead ends: 170 [2021-08-25 20:22:32,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-25 20:22:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-25 20:22:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2021-08-25 20:22:32,535 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 58 [2021-08-25 20:22:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,535 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2021-08-25 20:22:32,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2021-08-25 20:22:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:22:32,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,536 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:22:32,536 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash -666876654, now seen corresponding path program 1 times [2021-08-25 20:22:32,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617054809] [2021-08-25 20:22:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:32,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617054809] [2021-08-25 20:22:32,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617054809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113712099] [2021-08-25 20:22:32,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,603 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:32,793 INFO L93 Difference]: Finished difference Result 308 states and 478 transitions. [2021-08-25 20:22:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:22:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:32,795 INFO L225 Difference]: With dead ends: 308 [2021-08-25 20:22:32,795 INFO L226 Difference]: Without dead ends: 170 [2021-08-25 20:22:32,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-25 20:22:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-25 20:22:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5512820512820513) internal successors, (242), 156 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2021-08-25 20:22:32,799 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 59 [2021-08-25 20:22:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:32,799 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2021-08-25 20:22:32,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2021-08-25 20:22:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:22:32,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:32,800 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:32,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:22:32,800 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1227571536, now seen corresponding path program 1 times [2021-08-25 20:22:32,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:32,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344113056] [2021-08-25 20:22:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:32,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:32,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:32,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344113056] [2021-08-25 20:22:32,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344113056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:32,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:32,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:32,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112608196] [2021-08-25 20:22:32,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:32,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:32,884 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,091 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2021-08-25 20:22:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-25 20:22:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,093 INFO L225 Difference]: With dead ends: 308 [2021-08-25 20:22:33,093 INFO L226 Difference]: Without dead ends: 170 [2021-08-25 20:22:33,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-25 20:22:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-25 20:22:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.544871794871795) internal successors, (241), 156 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2021-08-25 20:22:33,096 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 60 [2021-08-25 20:22:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,096 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2021-08-25 20:22:33,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2021-08-25 20:22:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:22:33,096 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,096 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:22:33,097 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 378861101, now seen corresponding path program 1 times [2021-08-25 20:22:33,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674433369] [2021-08-25 20:22:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:33,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674433369] [2021-08-25 20:22:33,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674433369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686892001] [2021-08-25 20:22:33,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,130 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,301 INFO L93 Difference]: Finished difference Result 298 states and 463 transitions. [2021-08-25 20:22:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-25 20:22:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,306 INFO L225 Difference]: With dead ends: 298 [2021-08-25 20:22:33,306 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:22:33,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:22:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2021-08-25 20:22:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5384615384615385) internal successors, (240), 156 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2021-08-25 20:22:33,309 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 61 [2021-08-25 20:22:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,309 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2021-08-25 20:22:33,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2021-08-25 20:22:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:22:33,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,309 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:22:33,309 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1409346107, now seen corresponding path program 1 times [2021-08-25 20:22:33,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774526177] [2021-08-25 20:22:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:33,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774526177] [2021-08-25 20:22:33,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774526177] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780346535] [2021-08-25 20:22:33,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,343 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,546 INFO L93 Difference]: Finished difference Result 338 states and 524 transitions. [2021-08-25 20:22:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-25 20:22:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,548 INFO L225 Difference]: With dead ends: 338 [2021-08-25 20:22:33,548 INFO L226 Difference]: Without dead ends: 200 [2021-08-25 20:22:33,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-25 20:22:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2021-08-25 20:22:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5617977528089888) internal successors, (278), 178 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2021-08-25 20:22:33,551 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 61 [2021-08-25 20:22:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,551 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2021-08-25 20:22:33,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2021-08-25 20:22:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:22:33,552 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,552 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:22:33,552 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash -550111145, now seen corresponding path program 1 times [2021-08-25 20:22:33,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421424054] [2021-08-25 20:22:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:33,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421424054] [2021-08-25 20:22:33,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421424054] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385175637] [2021-08-25 20:22:33,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,620 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:33,817 INFO L93 Difference]: Finished difference Result 360 states and 561 transitions. [2021-08-25 20:22:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:33,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:22:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:33,818 INFO L225 Difference]: With dead ends: 360 [2021-08-25 20:22:33,818 INFO L226 Difference]: Without dead ends: 200 [2021-08-25 20:22:33,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-25 20:22:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2021-08-25 20:22:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 178 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2021-08-25 20:22:33,822 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 74 [2021-08-25 20:22:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:33,822 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2021-08-25 20:22:33,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2021-08-25 20:22:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:22:33,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:33,823 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:33,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:22:33,823 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 30473293, now seen corresponding path program 1 times [2021-08-25 20:22:33,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:33,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320734844] [2021-08-25 20:22:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:33,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:33,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:33,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320734844] [2021-08-25 20:22:33,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320734844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:33,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:33,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:33,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414457958] [2021-08-25 20:22:33,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:33,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:33,889 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,075 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2021-08-25 20:22:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:22:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,076 INFO L225 Difference]: With dead ends: 359 [2021-08-25 20:22:34,076 INFO L226 Difference]: Without dead ends: 199 [2021-08-25 20:22:34,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-25 20:22:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2021-08-25 20:22:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.550561797752809) internal successors, (276), 178 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2021-08-25 20:22:34,080 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 75 [2021-08-25 20:22:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,080 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2021-08-25 20:22:34,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2021-08-25 20:22:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:22:34,080 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,080 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:22:34,081 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash 73802114, now seen corresponding path program 1 times [2021-08-25 20:22:34,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164458653] [2021-08-25 20:22:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:34,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164458653] [2021-08-25 20:22:34,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164458653] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:34,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402439111] [2021-08-25 20:22:34,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:34,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:34,148 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,328 INFO L93 Difference]: Finished difference Result 357 states and 554 transitions. [2021-08-25 20:22:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:22:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,329 INFO L225 Difference]: With dead ends: 357 [2021-08-25 20:22:34,330 INFO L226 Difference]: Without dead ends: 197 [2021-08-25 20:22:34,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-25 20:22:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2021-08-25 20:22:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5449438202247192) internal successors, (275), 178 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2021-08-25 20:22:34,333 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 75 [2021-08-25 20:22:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,333 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2021-08-25 20:22:34,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2021-08-25 20:22:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:22:34,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,333 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:22:34,334 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2044088898, now seen corresponding path program 1 times [2021-08-25 20:22:34,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633778645] [2021-08-25 20:22:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:34,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633778645] [2021-08-25 20:22:34,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633778645] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:34,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600090567] [2021-08-25 20:22:34,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:34,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:34,403 INFO L87 Difference]: Start difference. First operand 179 states and 275 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,590 INFO L93 Difference]: Finished difference Result 356 states and 551 transitions. [2021-08-25 20:22:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:22:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,592 INFO L225 Difference]: With dead ends: 356 [2021-08-25 20:22:34,592 INFO L226 Difference]: Without dead ends: 196 [2021-08-25 20:22:34,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-25 20:22:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2021-08-25 20:22:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5393258426966292) internal successors, (274), 178 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 274 transitions. [2021-08-25 20:22:34,595 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 274 transitions. Word has length 75 [2021-08-25 20:22:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,595 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 274 transitions. [2021-08-25 20:22:34,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 274 transitions. [2021-08-25 20:22:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:22:34,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,596 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:22:34,596 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1605062087, now seen corresponding path program 1 times [2021-08-25 20:22:34,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528344448] [2021-08-25 20:22:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:34,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528344448] [2021-08-25 20:22:34,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528344448] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:34,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003376318] [2021-08-25 20:22:34,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:34,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:34,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:34,647 INFO L87 Difference]: Start difference. First operand 179 states and 274 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:34,835 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2021-08-25 20:22:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:34,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:22:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:34,837 INFO L225 Difference]: With dead ends: 356 [2021-08-25 20:22:34,837 INFO L226 Difference]: Without dead ends: 196 [2021-08-25 20:22:34,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-25 20:22:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2021-08-25 20:22:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 178 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 273 transitions. [2021-08-25 20:22:34,840 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 273 transitions. Word has length 75 [2021-08-25 20:22:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:34,840 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 273 transitions. [2021-08-25 20:22:34,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 273 transitions. [2021-08-25 20:22:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:22:34,840 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:34,840 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:34,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:22:34,841 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1655656366, now seen corresponding path program 1 times [2021-08-25 20:22:34,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:34,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967995999] [2021-08-25 20:22:34,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:34,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:34,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:34,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967995999] [2021-08-25 20:22:34,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967995999] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:34,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:34,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:34,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656836647] [2021-08-25 20:22:34,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:34,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:34,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:34,876 INFO L87 Difference]: Start difference. First operand 179 states and 273 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:35,066 INFO L93 Difference]: Finished difference Result 356 states and 547 transitions. [2021-08-25 20:22:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:22:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:35,067 INFO L225 Difference]: With dead ends: 356 [2021-08-25 20:22:35,067 INFO L226 Difference]: Without dead ends: 196 [2021-08-25 20:22:35,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-25 20:22:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2021-08-25 20:22:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 178 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2021-08-25 20:22:35,070 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 76 [2021-08-25 20:22:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:35,070 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2021-08-25 20:22:35,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2021-08-25 20:22:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:22:35,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:35,071 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:35,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:22:35,071 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 211651124, now seen corresponding path program 1 times [2021-08-25 20:22:35,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:35,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102322686] [2021-08-25 20:22:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:35,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:35,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:35,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102322686] [2021-08-25 20:22:35,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102322686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:35,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:35,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:35,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430110183] [2021-08-25 20:22:35,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:35,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:35,118 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:35,323 INFO L93 Difference]: Finished difference Result 356 states and 545 transitions. [2021-08-25 20:22:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-25 20:22:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:35,324 INFO L225 Difference]: With dead ends: 356 [2021-08-25 20:22:35,324 INFO L226 Difference]: Without dead ends: 196 [2021-08-25 20:22:35,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-25 20:22:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2021-08-25 20:22:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5224719101123596) internal successors, (271), 178 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2021-08-25 20:22:35,328 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 77 [2021-08-25 20:22:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:35,328 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2021-08-25 20:22:35,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2021-08-25 20:22:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-25 20:22:35,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:35,329 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:35,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:22:35,329 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1049900599, now seen corresponding path program 1 times [2021-08-25 20:22:35,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:35,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842035195] [2021-08-25 20:22:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:35,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:22:35,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:35,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842035195] [2021-08-25 20:22:35,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842035195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:35,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:35,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:35,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311899127] [2021-08-25 20:22:35,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:35,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:35,362 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:35,574 INFO L93 Difference]: Finished difference Result 346 states and 530 transitions. [2021-08-25 20:22:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-25 20:22:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:35,575 INFO L225 Difference]: With dead ends: 346 [2021-08-25 20:22:35,575 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:22:35,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:22:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2021-08-25 20:22:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 178 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 270 transitions. [2021-08-25 20:22:35,578 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 270 transitions. Word has length 78 [2021-08-25 20:22:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:35,579 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 270 transitions. [2021-08-25 20:22:35,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 270 transitions. [2021-08-25 20:22:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 20:22:35,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:35,579 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:35,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:22:35,579 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -614883725, now seen corresponding path program 1 times [2021-08-25 20:22:35,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:35,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436618797] [2021-08-25 20:22:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:35,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:35,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:35,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436618797] [2021-08-25 20:22:35,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436618797] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:35,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:35,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:35,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701009979] [2021-08-25 20:22:35,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:35,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:35,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:35,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:35,640 INFO L87 Difference]: Start difference. First operand 179 states and 270 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:35,977 INFO L93 Difference]: Finished difference Result 454 states and 699 transitions. [2021-08-25 20:22:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-25 20:22:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:35,979 INFO L225 Difference]: With dead ends: 454 [2021-08-25 20:22:35,979 INFO L226 Difference]: Without dead ends: 294 [2021-08-25 20:22:35,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-08-25 20:22:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2021-08-25 20:22:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 344 transitions. [2021-08-25 20:22:35,983 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 344 transitions. Word has length 83 [2021-08-25 20:22:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:35,984 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 344 transitions. [2021-08-25 20:22:35,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 344 transitions. [2021-08-25 20:22:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 20:22:35,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:35,984 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:35,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:22:35,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -366737231, now seen corresponding path program 1 times [2021-08-25 20:22:35,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:35,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774653163] [2021-08-25 20:22:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:35,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:36,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:36,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774653163] [2021-08-25 20:22:36,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774653163] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:36,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:36,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:36,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135161970] [2021-08-25 20:22:36,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:36,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:36,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:36,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:36,057 INFO L87 Difference]: Start difference. First operand 220 states and 344 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:36,316 INFO L93 Difference]: Finished difference Result 471 states and 743 transitions. [2021-08-25 20:22:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-25 20:22:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:36,318 INFO L225 Difference]: With dead ends: 471 [2021-08-25 20:22:36,318 INFO L226 Difference]: Without dead ends: 270 [2021-08-25 20:22:36,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-08-25 20:22:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2021-08-25 20:22:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5884773662551441) internal successors, (386), 243 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 386 transitions. [2021-08-25 20:22:36,322 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 386 transitions. Word has length 83 [2021-08-25 20:22:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:36,322 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 386 transitions. [2021-08-25 20:22:36,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 386 transitions. [2021-08-25 20:22:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:22:36,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:36,323 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:36,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:22:36,323 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1739674319, now seen corresponding path program 1 times [2021-08-25 20:22:36,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:36,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343679199] [2021-08-25 20:22:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:36,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:36,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:36,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343679199] [2021-08-25 20:22:36,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343679199] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:36,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:36,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:36,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326287239] [2021-08-25 20:22:36,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:36,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:36,370 INFO L87 Difference]: Start difference. First operand 244 states and 386 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:36,650 INFO L93 Difference]: Finished difference Result 534 states and 843 transitions. [2021-08-25 20:22:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:36,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:22:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:36,651 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:22:36,651 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:22:36,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:22:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2021-08-25 20:22:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5860655737704918) internal successors, (387), 244 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 387 transitions. [2021-08-25 20:22:36,655 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 387 transitions. Word has length 84 [2021-08-25 20:22:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:36,656 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 387 transitions. [2021-08-25 20:22:36,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 387 transitions. [2021-08-25 20:22:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:22:36,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:36,657 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:36,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:22:36,657 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1240955497, now seen corresponding path program 1 times [2021-08-25 20:22:36,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:36,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8774599] [2021-08-25 20:22:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:36,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:36,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:36,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8774599] [2021-08-25 20:22:36,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8774599] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:36,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:36,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:36,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51167729] [2021-08-25 20:22:36,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:36,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:36,709 INFO L87 Difference]: Start difference. First operand 245 states and 387 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:37,012 INFO L93 Difference]: Finished difference Result 535 states and 843 transitions. [2021-08-25 20:22:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:22:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:37,015 INFO L225 Difference]: With dead ends: 535 [2021-08-25 20:22:37,015 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:22:37,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:22:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2021-08-25 20:22:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5819672131147542) internal successors, (386), 244 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 386 transitions. [2021-08-25 20:22:37,020 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 386 transitions. Word has length 96 [2021-08-25 20:22:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:37,021 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 386 transitions. [2021-08-25 20:22:37,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 386 transitions. [2021-08-25 20:22:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:22:37,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:37,022 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:37,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:22:37,022 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1667226389, now seen corresponding path program 1 times [2021-08-25 20:22:37,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:37,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47115941] [2021-08-25 20:22:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:37,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:37,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:37,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47115941] [2021-08-25 20:22:37,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47115941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:37,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:37,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:37,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129534296] [2021-08-25 20:22:37,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:37,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:37,072 INFO L87 Difference]: Start difference. First operand 245 states and 386 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:37,308 INFO L93 Difference]: Finished difference Result 497 states and 784 transitions. [2021-08-25 20:22:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:37,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-08-25 20:22:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:37,310 INFO L225 Difference]: With dead ends: 497 [2021-08-25 20:22:37,310 INFO L226 Difference]: Without dead ends: 271 [2021-08-25 20:22:37,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-25 20:22:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2021-08-25 20:22:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5778688524590163) internal successors, (385), 244 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 385 transitions. [2021-08-25 20:22:37,314 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 385 transitions. Word has length 96 [2021-08-25 20:22:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:37,314 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 385 transitions. [2021-08-25 20:22:37,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 385 transitions. [2021-08-25 20:22:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:37,315 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:37,315 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:37,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:22:37,315 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash -281035653, now seen corresponding path program 1 times [2021-08-25 20:22:37,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:37,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541153992] [2021-08-25 20:22:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:37,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:37,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:37,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541153992] [2021-08-25 20:22:37,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541153992] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:37,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:37,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:37,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066827880] [2021-08-25 20:22:37,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:37,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:37,353 INFO L87 Difference]: Start difference. First operand 245 states and 385 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:37,663 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2021-08-25 20:22:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:37,664 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:22:37,664 INFO L226 Difference]: Without dead ends: 308 [2021-08-25 20:22:37,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-08-25 20:22:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 245. [2021-08-25 20:22:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5737704918032787) internal successors, (384), 244 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 384 transitions. [2021-08-25 20:22:37,668 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 384 transitions. Word has length 97 [2021-08-25 20:22:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:37,668 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 384 transitions. [2021-08-25 20:22:37,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 384 transitions. [2021-08-25 20:22:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:37,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:37,669 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:37,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:22:37,669 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash -237706832, now seen corresponding path program 1 times [2021-08-25 20:22:37,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:37,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649519315] [2021-08-25 20:22:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:37,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:37,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:37,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649519315] [2021-08-25 20:22:37,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649519315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:37,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:37,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:37,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979641232] [2021-08-25 20:22:37,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:37,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:37,711 INFO L87 Difference]: Start difference. First operand 245 states and 384 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:37,979 INFO L93 Difference]: Finished difference Result 532 states and 834 transitions. [2021-08-25 20:22:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:37,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:37,980 INFO L225 Difference]: With dead ends: 532 [2021-08-25 20:22:37,980 INFO L226 Difference]: Without dead ends: 306 [2021-08-25 20:22:37,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-25 20:22:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 245. [2021-08-25 20:22:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 383 transitions. [2021-08-25 20:22:37,988 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 383 transitions. Word has length 97 [2021-08-25 20:22:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:37,988 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 383 transitions. [2021-08-25 20:22:37,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 383 transitions. [2021-08-25 20:22:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:37,989 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:37,989 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:37,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:22:37,990 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1732579952, now seen corresponding path program 1 times [2021-08-25 20:22:37,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:37,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624331053] [2021-08-25 20:22:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:37,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:38,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:38,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624331053] [2021-08-25 20:22:38,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624331053] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:38,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:38,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:38,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755469236] [2021-08-25 20:22:38,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:38,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:38,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:38,034 INFO L87 Difference]: Start difference. First operand 245 states and 383 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:38,299 INFO L93 Difference]: Finished difference Result 531 states and 831 transitions. [2021-08-25 20:22:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:38,301 INFO L225 Difference]: With dead ends: 531 [2021-08-25 20:22:38,301 INFO L226 Difference]: Without dead ends: 305 [2021-08-25 20:22:38,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-08-25 20:22:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 245. [2021-08-25 20:22:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5655737704918034) internal successors, (382), 244 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2021-08-25 20:22:38,305 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 97 [2021-08-25 20:22:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:38,305 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2021-08-25 20:22:38,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2021-08-25 20:22:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:38,305 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:38,306 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:38,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:22:38,306 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1916571033, now seen corresponding path program 1 times [2021-08-25 20:22:38,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:38,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594588618] [2021-08-25 20:22:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:38,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:22:38,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:38,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594588618] [2021-08-25 20:22:38,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594588618] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:38,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:38,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:22:38,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528671721] [2021-08-25 20:22:38,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:22:38,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:22:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:38,357 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:38,659 INFO L93 Difference]: Finished difference Result 492 states and 772 transitions. [2021-08-25 20:22:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:22:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:38,660 INFO L225 Difference]: With dead ends: 492 [2021-08-25 20:22:38,660 INFO L226 Difference]: Without dead ends: 266 [2021-08-25 20:22:38,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:22:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-08-25 20:22:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2021-08-25 20:22:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5454545454545454) internal successors, (408), 264 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 408 transitions. [2021-08-25 20:22:38,664 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 408 transitions. Word has length 97 [2021-08-25 20:22:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:38,664 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 408 transitions. [2021-08-25 20:22:38,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 408 transitions. [2021-08-25 20:22:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:38,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:38,665 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:38,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:22:38,666 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -197032082, now seen corresponding path program 1 times [2021-08-25 20:22:38,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:38,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563494983] [2021-08-25 20:22:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:38,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:38,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:38,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563494983] [2021-08-25 20:22:38,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563494983] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:38,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:38,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:38,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277629690] [2021-08-25 20:22:38,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:38,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:38,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:38,701 INFO L87 Difference]: Start difference. First operand 265 states and 408 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:38,902 INFO L93 Difference]: Finished difference Result 534 states and 824 transitions. [2021-08-25 20:22:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:38,903 INFO L225 Difference]: With dead ends: 534 [2021-08-25 20:22:38,904 INFO L226 Difference]: Without dead ends: 288 [2021-08-25 20:22:38,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-25 20:22:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 265. [2021-08-25 20:22:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5416666666666667) internal successors, (407), 264 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2021-08-25 20:22:38,908 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 97 [2021-08-25 20:22:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:38,908 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2021-08-25 20:22:38,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2021-08-25 20:22:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:22:38,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:38,909 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:38,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:22:38,909 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1773254702, now seen corresponding path program 1 times [2021-08-25 20:22:38,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:38,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598320149] [2021-08-25 20:22:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:38,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:38,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:38,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598320149] [2021-08-25 20:22:38,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598320149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:38,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:38,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:38,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527801781] [2021-08-25 20:22:38,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:38,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:38,943 INFO L87 Difference]: Start difference. First operand 265 states and 407 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:39,147 INFO L93 Difference]: Finished difference Result 533 states and 821 transitions. [2021-08-25 20:22:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:22:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:39,149 INFO L225 Difference]: With dead ends: 533 [2021-08-25 20:22:39,149 INFO L226 Difference]: Without dead ends: 287 [2021-08-25 20:22:39,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-25 20:22:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2021-08-25 20:22:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5378787878787878) internal successors, (406), 264 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2021-08-25 20:22:39,153 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 97 [2021-08-25 20:22:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:39,153 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2021-08-25 20:22:39,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2021-08-25 20:22:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:39,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:39,154 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:39,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:22:39,154 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -352879123, now seen corresponding path program 1 times [2021-08-25 20:22:39,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:39,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743385485] [2021-08-25 20:22:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:39,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:39,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:39,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743385485] [2021-08-25 20:22:39,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743385485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:39,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:39,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:39,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590103435] [2021-08-25 20:22:39,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:39,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:39,219 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:39,511 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2021-08-25 20:22:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:39,513 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:22:39,513 INFO L226 Difference]: Without dead ends: 325 [2021-08-25 20:22:39,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-25 20:22:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2021-08-25 20:22:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2021-08-25 20:22:39,518 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 98 [2021-08-25 20:22:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:39,518 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2021-08-25 20:22:39,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2021-08-25 20:22:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:22:39,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:39,519 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:39,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:22:39,519 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash 908038127, now seen corresponding path program 1 times [2021-08-25 20:22:39,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:39,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305125911] [2021-08-25 20:22:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:39,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:39,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:39,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305125911] [2021-08-25 20:22:39,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305125911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:39,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:39,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:39,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075558052] [2021-08-25 20:22:39,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:39,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:39,553 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:39,752 INFO L93 Difference]: Finished difference Result 533 states and 817 transitions. [2021-08-25 20:22:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:22:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:39,754 INFO L225 Difference]: With dead ends: 533 [2021-08-25 20:22:39,754 INFO L226 Difference]: Without dead ends: 287 [2021-08-25 20:22:39,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-25 20:22:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2021-08-25 20:22:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2021-08-25 20:22:39,758 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 98 [2021-08-25 20:22:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:39,758 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2021-08-25 20:22:39,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2021-08-25 20:22:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:22:39,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:39,759 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:39,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:22:39,759 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 4634164, now seen corresponding path program 1 times [2021-08-25 20:22:39,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:39,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297487283] [2021-08-25 20:22:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:39,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:39,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:39,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297487283] [2021-08-25 20:22:39,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297487283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:39,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:39,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:39,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131015713] [2021-08-25 20:22:39,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:39,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:39,800 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:40,072 INFO L93 Difference]: Finished difference Result 571 states and 872 transitions. [2021-08-25 20:22:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:22:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:40,073 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:22:40,073 INFO L226 Difference]: Without dead ends: 325 [2021-08-25 20:22:40,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-25 20:22:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2021-08-25 20:22:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5265151515151516) internal successors, (403), 264 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2021-08-25 20:22:40,078 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 99 [2021-08-25 20:22:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:40,079 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2021-08-25 20:22:40,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2021-08-25 20:22:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:22:40,079 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:40,079 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:40,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:22:40,079 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash 438363250, now seen corresponding path program 1 times [2021-08-25 20:22:40,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:40,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714032845] [2021-08-25 20:22:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:40,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:40,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:40,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714032845] [2021-08-25 20:22:40,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714032845] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:40,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:40,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:40,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284478747] [2021-08-25 20:22:40,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:40,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:40,117 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:40,339 INFO L93 Difference]: Finished difference Result 533 states and 813 transitions. [2021-08-25 20:22:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:22:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:40,341 INFO L225 Difference]: With dead ends: 533 [2021-08-25 20:22:40,341 INFO L226 Difference]: Without dead ends: 287 [2021-08-25 20:22:40,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-25 20:22:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2021-08-25 20:22:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5227272727272727) internal successors, (402), 264 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2021-08-25 20:22:40,345 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 99 [2021-08-25 20:22:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:40,345 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2021-08-25 20:22:40,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2021-08-25 20:22:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:22:40,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:40,346 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:40,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:22:40,346 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1836152622, now seen corresponding path program 1 times [2021-08-25 20:22:40,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:40,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241061582] [2021-08-25 20:22:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:40,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:40,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:40,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241061582] [2021-08-25 20:22:40,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241061582] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:40,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:40,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:40,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880674804] [2021-08-25 20:22:40,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:40,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:40,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:40,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:40,385 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:40,660 INFO L93 Difference]: Finished difference Result 571 states and 868 transitions. [2021-08-25 20:22:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:22:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:40,662 INFO L225 Difference]: With dead ends: 571 [2021-08-25 20:22:40,662 INFO L226 Difference]: Without dead ends: 325 [2021-08-25 20:22:40,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-25 20:22:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2021-08-25 20:22:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.518939393939394) internal successors, (401), 264 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2021-08-25 20:22:40,666 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 100 [2021-08-25 20:22:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:40,666 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2021-08-25 20:22:40,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2021-08-25 20:22:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:22:40,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:40,667 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:40,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:22:40,667 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1275452844, now seen corresponding path program 1 times [2021-08-25 20:22:40,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:40,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564654833] [2021-08-25 20:22:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:40,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:40,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:40,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564654833] [2021-08-25 20:22:40,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564654833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:40,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:40,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:40,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851760008] [2021-08-25 20:22:40,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:40,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:40,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:40,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:40,705 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:40,904 INFO L93 Difference]: Finished difference Result 533 states and 809 transitions. [2021-08-25 20:22:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:22:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:40,905 INFO L225 Difference]: With dead ends: 533 [2021-08-25 20:22:40,905 INFO L226 Difference]: Without dead ends: 287 [2021-08-25 20:22:40,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-25 20:22:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2021-08-25 20:22:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5151515151515151) internal successors, (400), 264 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2021-08-25 20:22:40,910 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 100 [2021-08-25 20:22:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:40,910 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2021-08-25 20:22:40,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2021-08-25 20:22:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:22:40,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:40,911 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:40,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:22:40,911 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1190202361, now seen corresponding path program 1 times [2021-08-25 20:22:40,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:40,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642158282] [2021-08-25 20:22:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:40,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:40,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:40,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642158282] [2021-08-25 20:22:40,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642158282] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:40,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:40,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:40,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083621412] [2021-08-25 20:22:40,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:40,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:40,947 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:41,200 INFO L93 Difference]: Finished difference Result 561 states and 852 transitions. [2021-08-25 20:22:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:22:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:41,201 INFO L225 Difference]: With dead ends: 561 [2021-08-25 20:22:41,201 INFO L226 Difference]: Without dead ends: 315 [2021-08-25 20:22:41,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-25 20:22:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2021-08-25 20:22:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5113636363636365) internal successors, (399), 264 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2021-08-25 20:22:41,206 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 101 [2021-08-25 20:22:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:41,206 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2021-08-25 20:22:41,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2021-08-25 20:22:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:22:41,206 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:41,207 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:41,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:22:41,207 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1392026295, now seen corresponding path program 1 times [2021-08-25 20:22:41,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:41,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903074565] [2021-08-25 20:22:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:41,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:41,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:41,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903074565] [2021-08-25 20:22:41,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903074565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:41,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:41,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:41,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444777559] [2021-08-25 20:22:41,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:41,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:41,252 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:41,441 INFO L93 Difference]: Finished difference Result 523 states and 793 transitions. [2021-08-25 20:22:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:41,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:22:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:41,442 INFO L225 Difference]: With dead ends: 523 [2021-08-25 20:22:41,442 INFO L226 Difference]: Without dead ends: 277 [2021-08-25 20:22:41,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-08-25 20:22:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2021-08-25 20:22:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5075757575757576) internal successors, (398), 264 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2021-08-25 20:22:41,447 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 101 [2021-08-25 20:22:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:41,447 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2021-08-25 20:22:41,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2021-08-25 20:22:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:22:41,448 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:41,448 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:41,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:22:41,449 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1404579251, now seen corresponding path program 1 times [2021-08-25 20:22:41,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:41,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440617572] [2021-08-25 20:22:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:41,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:41,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:41,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440617572] [2021-08-25 20:22:41,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440617572] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:41,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:41,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:41,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547930765] [2021-08-25 20:22:41,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:41,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:41,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:41,483 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:41,744 INFO L93 Difference]: Finished difference Result 561 states and 848 transitions. [2021-08-25 20:22:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:22:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:41,745 INFO L225 Difference]: With dead ends: 561 [2021-08-25 20:22:41,745 INFO L226 Difference]: Without dead ends: 315 [2021-08-25 20:22:41,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-25 20:22:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2021-08-25 20:22:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.503787878787879) internal successors, (397), 264 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2021-08-25 20:22:41,750 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 105 [2021-08-25 20:22:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:41,750 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2021-08-25 20:22:41,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2021-08-25 20:22:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:22:41,750 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:41,750 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:41,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:22:41,751 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:41,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1350186353, now seen corresponding path program 1 times [2021-08-25 20:22:41,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:41,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181180326] [2021-08-25 20:22:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:41,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:41,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:41,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181180326] [2021-08-25 20:22:41,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181180326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:41,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:41,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:41,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125788004] [2021-08-25 20:22:41,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:41,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:41,789 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:42,000 INFO L93 Difference]: Finished difference Result 564 states and 853 transitions. [2021-08-25 20:22:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:42,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:22:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:42,001 INFO L225 Difference]: With dead ends: 564 [2021-08-25 20:22:42,002 INFO L226 Difference]: Without dead ends: 318 [2021-08-25 20:22:42,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-25 20:22:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2021-08-25 20:22:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5241379310344827) internal successors, (442), 290 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2021-08-25 20:22:42,006 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 105 [2021-08-25 20:22:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:42,006 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2021-08-25 20:22:42,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2021-08-25 20:22:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-25 20:22:42,007 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:42,007 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:42,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:22:42,007 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2023363820, now seen corresponding path program 1 times [2021-08-25 20:22:42,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:42,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929887856] [2021-08-25 20:22:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:42,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:42,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:42,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929887856] [2021-08-25 20:22:42,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929887856] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:42,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:42,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:42,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540578321] [2021-08-25 20:22:42,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:42,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,044 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:42,305 INFO L93 Difference]: Finished difference Result 613 states and 936 transitions. [2021-08-25 20:22:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-08-25 20:22:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:42,307 INFO L225 Difference]: With dead ends: 613 [2021-08-25 20:22:42,307 INFO L226 Difference]: Without dead ends: 341 [2021-08-25 20:22:42,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-08-25 20:22:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2021-08-25 20:22:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5206896551724138) internal successors, (441), 290 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2021-08-25 20:22:42,312 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 108 [2021-08-25 20:22:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:42,312 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2021-08-25 20:22:42,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2021-08-25 20:22:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-25 20:22:42,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:42,317 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:42,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:22:42,318 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1505475213, now seen corresponding path program 1 times [2021-08-25 20:22:42,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:42,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118102604] [2021-08-25 20:22:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:42,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:42,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:42,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118102604] [2021-08-25 20:22:42,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118102604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:42,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:42,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:42,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177570755] [2021-08-25 20:22:42,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:42,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,355 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:42,590 INFO L93 Difference]: Finished difference Result 605 states and 921 transitions. [2021-08-25 20:22:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:42,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-08-25 20:22:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:42,591 INFO L225 Difference]: With dead ends: 605 [2021-08-25 20:22:42,591 INFO L226 Difference]: Without dead ends: 333 [2021-08-25 20:22:42,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-25 20:22:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2021-08-25 20:22:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5172413793103448) internal successors, (440), 290 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 440 transitions. [2021-08-25 20:22:42,596 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 440 transitions. Word has length 109 [2021-08-25 20:22:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:42,596 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 440 transitions. [2021-08-25 20:22:42,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 440 transitions. [2021-08-25 20:22:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-08-25 20:22:42,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:42,597 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:42,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:22:42,597 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1509096972, now seen corresponding path program 1 times [2021-08-25 20:22:42,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:42,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880751898] [2021-08-25 20:22:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:42,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:42,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:42,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880751898] [2021-08-25 20:22:42,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880751898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:42,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:42,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:42,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788158566] [2021-08-25 20:22:42,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:42,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,633 INFO L87 Difference]: Start difference. First operand 291 states and 440 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:42,864 INFO L93 Difference]: Finished difference Result 605 states and 919 transitions. [2021-08-25 20:22:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-08-25 20:22:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:42,865 INFO L225 Difference]: With dead ends: 605 [2021-08-25 20:22:42,865 INFO L226 Difference]: Without dead ends: 333 [2021-08-25 20:22:42,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-25 20:22:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2021-08-25 20:22:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.513793103448276) internal successors, (439), 290 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 439 transitions. [2021-08-25 20:22:42,870 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 439 transitions. Word has length 110 [2021-08-25 20:22:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:42,870 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 439 transitions. [2021-08-25 20:22:42,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 439 transitions. [2021-08-25 20:22:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:22:42,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:42,871 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:42,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:22:42,871 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1658939710, now seen corresponding path program 1 times [2021-08-25 20:22:42,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:42,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758127523] [2021-08-25 20:22:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:42,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:42,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:42,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758127523] [2021-08-25 20:22:42,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758127523] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:42,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:42,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:42,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864732408] [2021-08-25 20:22:42,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:42,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:42,907 INFO L87 Difference]: Start difference. First operand 291 states and 439 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:43,153 INFO L93 Difference]: Finished difference Result 605 states and 917 transitions. [2021-08-25 20:22:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-25 20:22:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:43,154 INFO L225 Difference]: With dead ends: 605 [2021-08-25 20:22:43,154 INFO L226 Difference]: Without dead ends: 333 [2021-08-25 20:22:43,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-25 20:22:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2021-08-25 20:22:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5103448275862068) internal successors, (438), 290 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 438 transitions. [2021-08-25 20:22:43,160 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 438 transitions. Word has length 111 [2021-08-25 20:22:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:43,161 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 438 transitions. [2021-08-25 20:22:43,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 438 transitions. [2021-08-25 20:22:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:22:43,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:43,162 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:43,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-25 20:22:43,163 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 246964595, now seen corresponding path program 1 times [2021-08-25 20:22:43,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:43,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205190425] [2021-08-25 20:22:43,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:43,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:43,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:43,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205190425] [2021-08-25 20:22:43,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205190425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:43,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:43,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:43,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018505097] [2021-08-25 20:22:43,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:43,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:43,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:43,213 INFO L87 Difference]: Start difference. First operand 291 states and 438 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:43,496 INFO L93 Difference]: Finished difference Result 603 states and 913 transitions. [2021-08-25 20:22:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-25 20:22:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:43,498 INFO L225 Difference]: With dead ends: 603 [2021-08-25 20:22:43,498 INFO L226 Difference]: Without dead ends: 331 [2021-08-25 20:22:43,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-08-25 20:22:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2021-08-25 20:22:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.506896551724138) internal successors, (437), 290 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 437 transitions. [2021-08-25 20:22:43,503 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 437 transitions. Word has length 111 [2021-08-25 20:22:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:43,503 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 437 transitions. [2021-08-25 20:22:43,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 437 transitions. [2021-08-25 20:22:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:22:43,504 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:43,504 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:43,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-25 20:22:43,504 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2008149001, now seen corresponding path program 1 times [2021-08-25 20:22:43,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:43,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481138612] [2021-08-25 20:22:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:43,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:43,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:43,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481138612] [2021-08-25 20:22:43,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481138612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:43,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:43,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:43,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952859515] [2021-08-25 20:22:43,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:43,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:43,542 INFO L87 Difference]: Start difference. First operand 291 states and 437 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:43,799 INFO L93 Difference]: Finished difference Result 601 states and 908 transitions. [2021-08-25 20:22:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-08-25 20:22:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:43,802 INFO L225 Difference]: With dead ends: 601 [2021-08-25 20:22:43,802 INFO L226 Difference]: Without dead ends: 329 [2021-08-25 20:22:43,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-08-25 20:22:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2021-08-25 20:22:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5034482758620689) internal successors, (436), 290 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2021-08-25 20:22:43,809 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 112 [2021-08-25 20:22:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:43,810 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2021-08-25 20:22:43,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2021-08-25 20:22:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:22:43,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:43,811 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:43,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-25 20:22:43,812 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash 123475374, now seen corresponding path program 1 times [2021-08-25 20:22:43,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:43,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682152146] [2021-08-25 20:22:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:43,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:43,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:43,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682152146] [2021-08-25 20:22:43,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682152146] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:43,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:43,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:43,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797526247] [2021-08-25 20:22:43,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:43,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:43,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:43,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:43,861 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:44,161 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2021-08-25 20:22:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-08-25 20:22:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:44,162 INFO L225 Difference]: With dead ends: 598 [2021-08-25 20:22:44,162 INFO L226 Difference]: Without dead ends: 326 [2021-08-25 20:22:44,163 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-25 20:22:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2021-08-25 20:22:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.5) internal successors, (435), 290 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2021-08-25 20:22:44,168 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2021-08-25 20:22:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:44,168 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2021-08-25 20:22:44,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2021-08-25 20:22:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:22:44,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:44,169 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:44,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-25 20:22:44,170 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1099399623, now seen corresponding path program 1 times [2021-08-25 20:22:44,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:44,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221297635] [2021-08-25 20:22:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:44,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:44,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:44,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221297635] [2021-08-25 20:22:44,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221297635] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:44,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:44,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:44,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131679791] [2021-08-25 20:22:44,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:44,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:44,211 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:44,504 INFO L93 Difference]: Finished difference Result 598 states and 900 transitions. [2021-08-25 20:22:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-25 20:22:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:44,506 INFO L225 Difference]: With dead ends: 598 [2021-08-25 20:22:44,506 INFO L226 Difference]: Without dead ends: 326 [2021-08-25 20:22:44,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-25 20:22:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2021-08-25 20:22:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4965517241379311) internal successors, (434), 290 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2021-08-25 20:22:44,511 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 115 [2021-08-25 20:22:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:44,511 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2021-08-25 20:22:44,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2021-08-25 20:22:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:22:44,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:44,514 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:44,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-25 20:22:44,514 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash -868715753, now seen corresponding path program 1 times [2021-08-25 20:22:44,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:44,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824239311] [2021-08-25 20:22:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:44,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:44,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:44,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824239311] [2021-08-25 20:22:44,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824239311] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:44,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:44,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:44,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422446174] [2021-08-25 20:22:44,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:44,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:44,554 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:44,812 INFO L93 Difference]: Finished difference Result 592 states and 889 transitions. [2021-08-25 20:22:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-25 20:22:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:44,813 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:22:44,813 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:22:44,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:22:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2021-08-25 20:22:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.493103448275862) internal successors, (433), 290 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2021-08-25 20:22:44,823 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 116 [2021-08-25 20:22:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:44,823 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2021-08-25 20:22:44,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2021-08-25 20:22:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:22:44,824 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:44,824 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:44,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-25 20:22:44,824 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1364168669, now seen corresponding path program 1 times [2021-08-25 20:22:44,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:44,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505236400] [2021-08-25 20:22:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:44,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:44,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:44,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505236400] [2021-08-25 20:22:44,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505236400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:44,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:44,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:44,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580171228] [2021-08-25 20:22:44,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:44,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:44,873 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:45,139 INFO L93 Difference]: Finished difference Result 592 states and 887 transitions. [2021-08-25 20:22:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-25 20:22:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:45,141 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:22:45,141 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:22:45,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:22:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2021-08-25 20:22:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2021-08-25 20:22:45,146 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 116 [2021-08-25 20:22:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:45,146 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2021-08-25 20:22:45,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2021-08-25 20:22:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:22:45,147 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:45,147 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:45,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-25 20:22:45,147 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -816836065, now seen corresponding path program 1 times [2021-08-25 20:22:45,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:45,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910080081] [2021-08-25 20:22:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:45,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:45,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:45,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910080081] [2021-08-25 20:22:45,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910080081] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:45,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:45,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:45,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325737398] [2021-08-25 20:22:45,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:45,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:45,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:45,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:45,193 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:45,437 INFO L93 Difference]: Finished difference Result 589 states and 881 transitions. [2021-08-25 20:22:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-25 20:22:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:45,438 INFO L225 Difference]: With dead ends: 589 [2021-08-25 20:22:45,438 INFO L226 Difference]: Without dead ends: 317 [2021-08-25 20:22:45,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-25 20:22:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2021-08-25 20:22:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.486206896551724) internal successors, (431), 290 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2021-08-25 20:22:45,443 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 117 [2021-08-25 20:22:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:45,443 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2021-08-25 20:22:45,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2021-08-25 20:22:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-25 20:22:45,444 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:45,444 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:45,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-25 20:22:45,444 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:45,444 INFO L82 PathProgramCache]: Analyzing trace with hash 144074853, now seen corresponding path program 1 times [2021-08-25 20:22:45,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:45,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333059926] [2021-08-25 20:22:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:45,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:45,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:45,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333059926] [2021-08-25 20:22:45,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333059926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:45,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:45,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:45,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440309310] [2021-08-25 20:22:45,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:45,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:45,483 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:45,701 INFO L93 Difference]: Finished difference Result 589 states and 879 transitions. [2021-08-25 20:22:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:45,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-08-25 20:22:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:45,702 INFO L225 Difference]: With dead ends: 589 [2021-08-25 20:22:45,702 INFO L226 Difference]: Without dead ends: 317 [2021-08-25 20:22:45,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-25 20:22:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2021-08-25 20:22:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4827586206896552) internal successors, (430), 290 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2021-08-25 20:22:45,707 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 118 [2021-08-25 20:22:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:45,707 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2021-08-25 20:22:45,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2021-08-25 20:22:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-25 20:22:45,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:45,708 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:45,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-25 20:22:45,709 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 923316267, now seen corresponding path program 1 times [2021-08-25 20:22:45,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:45,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214600822] [2021-08-25 20:22:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:45,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-25 20:22:45,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:45,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214600822] [2021-08-25 20:22:45,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214600822] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:45,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:45,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:45,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148233752] [2021-08-25 20:22:45,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:45,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:45,745 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:45,996 INFO L93 Difference]: Finished difference Result 635 states and 950 transitions. [2021-08-25 20:22:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-08-25 20:22:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:45,998 INFO L225 Difference]: With dead ends: 635 [2021-08-25 20:22:45,998 INFO L226 Difference]: Without dead ends: 363 [2021-08-25 20:22:45,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-08-25 20:22:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2021-08-25 20:22:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.5124223602484472) internal successors, (487), 322 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 487 transitions. [2021-08-25 20:22:46,004 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 487 transitions. Word has length 118 [2021-08-25 20:22:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:46,004 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 487 transitions. [2021-08-25 20:22:46,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 487 transitions. [2021-08-25 20:22:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:22:46,004 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:46,004 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:46,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-25 20:22:46,005 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -599704185, now seen corresponding path program 1 times [2021-08-25 20:22:46,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:46,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385694562] [2021-08-25 20:22:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:46,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:46,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:46,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385694562] [2021-08-25 20:22:46,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385694562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:46,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:46,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:46,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530578306] [2021-08-25 20:22:46,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:46,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:46,055 INFO L87 Difference]: Start difference. First operand 323 states and 487 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:46,289 INFO L93 Difference]: Finished difference Result 650 states and 987 transitions. [2021-08-25 20:22:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-25 20:22:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:46,290 INFO L225 Difference]: With dead ends: 650 [2021-08-25 20:22:46,290 INFO L226 Difference]: Without dead ends: 346 [2021-08-25 20:22:46,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-08-25 20:22:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2021-08-25 20:22:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.5093167701863355) internal successors, (486), 322 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 486 transitions. [2021-08-25 20:22:46,295 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 486 transitions. Word has length 119 [2021-08-25 20:22:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:46,296 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 486 transitions. [2021-08-25 20:22:46,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 486 transitions. [2021-08-25 20:22:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:22:46,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:46,297 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:46,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-25 20:22:46,297 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash 475698414, now seen corresponding path program 1 times [2021-08-25 20:22:46,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:46,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278624502] [2021-08-25 20:22:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:46,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:46,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:46,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278624502] [2021-08-25 20:22:46,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278624502] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:46,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:46,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:46,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717519732] [2021-08-25 20:22:46,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:46,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:46,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:46,372 INFO L87 Difference]: Start difference. First operand 323 states and 486 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:46,670 INFO L93 Difference]: Finished difference Result 739 states and 1126 transitions. [2021-08-25 20:22:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-25 20:22:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:46,672 INFO L225 Difference]: With dead ends: 739 [2021-08-25 20:22:46,672 INFO L226 Difference]: Without dead ends: 435 [2021-08-25 20:22:46,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-08-25 20:22:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 362. [2021-08-25 20:22:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.5429362880886426) internal successors, (557), 361 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 557 transitions. [2021-08-25 20:22:46,679 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 557 transitions. Word has length 119 [2021-08-25 20:22:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:46,679 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 557 transitions. [2021-08-25 20:22:46,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 557 transitions. [2021-08-25 20:22:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-25 20:22:46,680 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:46,680 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:46,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-25 20:22:46,680 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2003600918, now seen corresponding path program 1 times [2021-08-25 20:22:46,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:46,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311544540] [2021-08-25 20:22:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:46,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:46,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:46,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311544540] [2021-08-25 20:22:46,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311544540] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:46,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:46,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:46,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308383500] [2021-08-25 20:22:46,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:46,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:46,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:46,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:46,716 INFO L87 Difference]: Start difference. First operand 362 states and 557 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:47,000 INFO L93 Difference]: Finished difference Result 769 states and 1183 transitions. [2021-08-25 20:22:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-08-25 20:22:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:47,001 INFO L225 Difference]: With dead ends: 769 [2021-08-25 20:22:47,001 INFO L226 Difference]: Without dead ends: 426 [2021-08-25 20:22:47,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-08-25 20:22:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 361. [2021-08-25 20:22:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5444444444444445) internal successors, (556), 360 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 556 transitions. [2021-08-25 20:22:47,008 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 556 transitions. Word has length 120 [2021-08-25 20:22:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:47,008 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 556 transitions. [2021-08-25 20:22:47,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 556 transitions. [2021-08-25 20:22:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-25 20:22:47,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:47,009 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:47,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-25 20:22:47,009 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash -661501137, now seen corresponding path program 1 times [2021-08-25 20:22:47,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:47,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515109360] [2021-08-25 20:22:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:47,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:47,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:47,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515109360] [2021-08-25 20:22:47,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515109360] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:47,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:47,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:47,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581518369] [2021-08-25 20:22:47,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:47,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:47,075 INFO L87 Difference]: Start difference. First operand 361 states and 556 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:47,276 INFO L93 Difference]: Finished difference Result 730 states and 1125 transitions. [2021-08-25 20:22:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-08-25 20:22:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:47,278 INFO L225 Difference]: With dead ends: 730 [2021-08-25 20:22:47,278 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:22:47,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:22:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2021-08-25 20:22:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5416666666666667) internal successors, (555), 360 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 555 transitions. [2021-08-25 20:22:47,284 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 555 transitions. Word has length 120 [2021-08-25 20:22:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:47,284 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 555 transitions. [2021-08-25 20:22:47,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 555 transitions. [2021-08-25 20:22:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:22:47,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:47,285 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:47,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-25 20:22:47,285 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash -972713678, now seen corresponding path program 1 times [2021-08-25 20:22:47,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:47,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386685796] [2021-08-25 20:22:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:47,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:47,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:47,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386685796] [2021-08-25 20:22:47,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386685796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:47,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:47,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:47,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996485348] [2021-08-25 20:22:47,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:47,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:47,342 INFO L87 Difference]: Start difference. First operand 361 states and 555 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:47,553 INFO L93 Difference]: Finished difference Result 730 states and 1123 transitions. [2021-08-25 20:22:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-25 20:22:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:47,554 INFO L225 Difference]: With dead ends: 730 [2021-08-25 20:22:47,555 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:22:47,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:22:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2021-08-25 20:22:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.538888888888889) internal successors, (554), 360 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 554 transitions. [2021-08-25 20:22:47,561 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 554 transitions. Word has length 121 [2021-08-25 20:22:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:47,562 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 554 transitions. [2021-08-25 20:22:47,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 554 transitions. [2021-08-25 20:22:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:22:47,563 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:47,563 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:47,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-25 20:22:47,563 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2069164652, now seen corresponding path program 1 times [2021-08-25 20:22:47,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:47,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181998692] [2021-08-25 20:22:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:47,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:47,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:47,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181998692] [2021-08-25 20:22:47,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181998692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:47,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:47,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:47,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780738295] [2021-08-25 20:22:47,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:47,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:47,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:47,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:47,601 INFO L87 Difference]: Start difference. First operand 361 states and 554 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:47,805 INFO L93 Difference]: Finished difference Result 730 states and 1121 transitions. [2021-08-25 20:22:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-25 20:22:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:47,807 INFO L225 Difference]: With dead ends: 730 [2021-08-25 20:22:47,807 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:22:47,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:22:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2021-08-25 20:22:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 360 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 553 transitions. [2021-08-25 20:22:47,813 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 553 transitions. Word has length 122 [2021-08-25 20:22:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:47,814 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 553 transitions. [2021-08-25 20:22:47,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 553 transitions. [2021-08-25 20:22:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:22:47,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:47,814 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:47,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-25 20:22:47,815 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1738203273, now seen corresponding path program 1 times [2021-08-25 20:22:47,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:47,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614938569] [2021-08-25 20:22:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:47,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:47,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:47,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614938569] [2021-08-25 20:22:47,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614938569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:47,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:47,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:47,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248538502] [2021-08-25 20:22:47,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:47,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:47,891 INFO L87 Difference]: Start difference. First operand 361 states and 553 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:48,075 INFO L93 Difference]: Finished difference Result 720 states and 1107 transitions. [2021-08-25 20:22:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-08-25 20:22:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:48,077 INFO L225 Difference]: With dead ends: 720 [2021-08-25 20:22:48,077 INFO L226 Difference]: Without dead ends: 378 [2021-08-25 20:22:48,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-08-25 20:22:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2021-08-25 20:22:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5333333333333334) internal successors, (552), 360 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2021-08-25 20:22:48,087 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 123 [2021-08-25 20:22:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:48,087 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2021-08-25 20:22:48,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2021-08-25 20:22:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:22:48,088 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:48,088 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:48,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-25 20:22:48,089 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:48,109 INFO L82 PathProgramCache]: Analyzing trace with hash -213721941, now seen corresponding path program 1 times [2021-08-25 20:22:48,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:48,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733528302] [2021-08-25 20:22:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:48,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:48,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:48,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733528302] [2021-08-25 20:22:48,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733528302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:48,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:48,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:48,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967411983] [2021-08-25 20:22:48,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:48,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,173 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:48,262 INFO L93 Difference]: Finished difference Result 1040 states and 1606 transitions. [2021-08-25 20:22:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:48,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-08-25 20:22:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:48,264 INFO L225 Difference]: With dead ends: 1040 [2021-08-25 20:22:48,264 INFO L226 Difference]: Without dead ends: 698 [2021-08-25 20:22:48,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-08-25 20:22:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2021-08-25 20:22:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.516546762589928) internal successors, (1054), 695 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1054 transitions. [2021-08-25 20:22:48,284 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1054 transitions. Word has length 124 [2021-08-25 20:22:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:48,284 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1054 transitions. [2021-08-25 20:22:48,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1054 transitions. [2021-08-25 20:22:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:22:48,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:48,286 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:48,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-25 20:22:48,286 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1662760877, now seen corresponding path program 1 times [2021-08-25 20:22:48,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:48,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578915382] [2021-08-25 20:22:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:48,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:22:48,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:48,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578915382] [2021-08-25 20:22:48,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578915382] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:48,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:48,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:48,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805839430] [2021-08-25 20:22:48,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:48,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,339 INFO L87 Difference]: Start difference. First operand 696 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:48,398 INFO L93 Difference]: Finished difference Result 1400 states and 2123 transitions. [2021-08-25 20:22:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-08-25 20:22:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:48,400 INFO L225 Difference]: With dead ends: 1400 [2021-08-25 20:22:48,400 INFO L226 Difference]: Without dead ends: 723 [2021-08-25 20:22:48,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-08-25 20:22:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-08-25 20:22:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.5083102493074791) internal successors, (1089), 722 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1089 transitions. [2021-08-25 20:22:48,432 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1089 transitions. Word has length 124 [2021-08-25 20:22:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:48,432 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 1089 transitions. [2021-08-25 20:22:48,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1089 transitions. [2021-08-25 20:22:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-08-25 20:22:48,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:48,434 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:48,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-25 20:22:48,434 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1781202351, now seen corresponding path program 1 times [2021-08-25 20:22:48,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:48,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221827684] [2021-08-25 20:22:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:48,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-25 20:22:48,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:48,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221827684] [2021-08-25 20:22:48,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221827684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:48,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:48,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:22:48,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339438521] [2021-08-25 20:22:48,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:22:48,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:22:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,487 INFO L87 Difference]: Start difference. First operand 723 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:48,539 INFO L93 Difference]: Finished difference Result 1429 states and 2159 transitions. [2021-08-25 20:22:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:22:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-08-25 20:22:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:48,541 INFO L225 Difference]: With dead ends: 1429 [2021-08-25 20:22:48,541 INFO L226 Difference]: Without dead ends: 725 [2021-08-25 20:22:48,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:22:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-08-25 20:22:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2021-08-25 20:22:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.5069060773480663) internal successors, (1091), 724 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1091 transitions. [2021-08-25 20:22:48,573 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1091 transitions. Word has length 124 [2021-08-25 20:22:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:48,573 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1091 transitions. [2021-08-25 20:22:48,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1091 transitions. [2021-08-25 20:22:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-25 20:22:48,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:48,574 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:48,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-25 20:22:48,575 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -181093733, now seen corresponding path program 1 times [2021-08-25 20:22:48,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:48,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660836730] [2021-08-25 20:22:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:48,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:48,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:48,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660836730] [2021-08-25 20:22:48,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660836730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:48,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:48,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:48,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101571101] [2021-08-25 20:22:48,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:48,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:48,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:48,638 INFO L87 Difference]: Start difference. First operand 725 states and 1091 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:48,919 INFO L93 Difference]: Finished difference Result 1649 states and 2491 transitions. [2021-08-25 20:22:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-08-25 20:22:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:48,922 INFO L225 Difference]: With dead ends: 1649 [2021-08-25 20:22:48,922 INFO L226 Difference]: Without dead ends: 945 [2021-08-25 20:22:48,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-08-25 20:22:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 803. [2021-08-25 20:22:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.5374064837905237) internal successors, (1233), 802 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1233 transitions. [2021-08-25 20:22:48,968 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1233 transitions. Word has length 127 [2021-08-25 20:22:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:48,968 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1233 transitions. [2021-08-25 20:22:48,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1233 transitions. [2021-08-25 20:22:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-25 20:22:48,969 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:48,969 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:48,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-25 20:22:48,970 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1177086455, now seen corresponding path program 1 times [2021-08-25 20:22:48,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:48,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839623864] [2021-08-25 20:22:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:48,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:49,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:49,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839623864] [2021-08-25 20:22:49,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839623864] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:49,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:49,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:49,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828259914] [2021-08-25 20:22:49,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:49,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:49,044 INFO L87 Difference]: Start difference. First operand 803 states and 1233 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:49,372 INFO L93 Difference]: Finished difference Result 1713 states and 2613 transitions. [2021-08-25 20:22:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-08-25 20:22:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:49,375 INFO L225 Difference]: With dead ends: 1713 [2021-08-25 20:22:49,375 INFO L226 Difference]: Without dead ends: 931 [2021-08-25 20:22:49,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-08-25 20:22:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 725. [2021-08-25 20:22:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.5069060773480663) internal successors, (1091), 724 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1091 transitions. [2021-08-25 20:22:49,389 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1091 transitions. Word has length 128 [2021-08-25 20:22:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:49,389 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1091 transitions. [2021-08-25 20:22:49,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1091 transitions. [2021-08-25 20:22:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-08-25 20:22:49,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:49,391 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:49,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-25 20:22:49,391 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1073512160, now seen corresponding path program 1 times [2021-08-25 20:22:49,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:49,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656975946] [2021-08-25 20:22:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:49,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:22:49,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:49,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656975946] [2021-08-25 20:22:49,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656975946] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:49,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:49,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:49,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634838675] [2021-08-25 20:22:49,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:49,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:49,428 INFO L87 Difference]: Start difference. First operand 725 states and 1091 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:49,644 INFO L93 Difference]: Finished difference Result 1461 states and 2199 transitions. [2021-08-25 20:22:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:49,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-08-25 20:22:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:49,646 INFO L225 Difference]: With dead ends: 1461 [2021-08-25 20:22:49,646 INFO L226 Difference]: Without dead ends: 757 [2021-08-25 20:22:49,647 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-08-25 20:22:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2021-08-25 20:22:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5027397260273974) internal successors, (1097), 730 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1097 transitions. [2021-08-25 20:22:49,659 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1097 transitions. Word has length 129 [2021-08-25 20:22:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:49,660 INFO L470 AbstractCegarLoop]: Abstraction has 731 states and 1097 transitions. [2021-08-25 20:22:49,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1097 transitions. [2021-08-25 20:22:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:22:49,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:49,661 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:49,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-25 20:22:49,661 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1409563339, now seen corresponding path program 1 times [2021-08-25 20:22:49,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:49,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165166877] [2021-08-25 20:22:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:49,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:22:49,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:49,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165166877] [2021-08-25 20:22:49,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165166877] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:49,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:49,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:49,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258535109] [2021-08-25 20:22:49,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:49,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:49,696 INFO L87 Difference]: Start difference. First operand 731 states and 1097 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:49,897 INFO L93 Difference]: Finished difference Result 1475 states and 2213 transitions. [2021-08-25 20:22:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:22:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:49,899 INFO L225 Difference]: With dead ends: 1475 [2021-08-25 20:22:49,899 INFO L226 Difference]: Without dead ends: 765 [2021-08-25 20:22:49,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-08-25 20:22:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 731. [2021-08-25 20:22:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5) internal successors, (1095), 730 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1095 transitions. [2021-08-25 20:22:49,912 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1095 transitions. Word has length 133 [2021-08-25 20:22:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:49,912 INFO L470 AbstractCegarLoop]: Abstraction has 731 states and 1095 transitions. [2021-08-25 20:22:49,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1095 transitions. [2021-08-25 20:22:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:22:49,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:49,914 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:49,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-25 20:22:49,914 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:49,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1255557316, now seen corresponding path program 1 times [2021-08-25 20:22:49,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:49,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736174255] [2021-08-25 20:22:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:49,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:22:49,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:49,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736174255] [2021-08-25 20:22:49,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736174255] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:49,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:49,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:49,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81829013] [2021-08-25 20:22:49,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:49,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:49,951 INFO L87 Difference]: Start difference. First operand 731 states and 1095 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:50,195 INFO L93 Difference]: Finished difference Result 1567 states and 2359 transitions. [2021-08-25 20:22:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:22:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:50,197 INFO L225 Difference]: With dead ends: 1567 [2021-08-25 20:22:50,197 INFO L226 Difference]: Without dead ends: 857 [2021-08-25 20:22:50,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2021-08-25 20:22:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 787. [2021-08-25 20:22:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.5178117048346056) internal successors, (1193), 786 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2021-08-25 20:22:50,217 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 133 [2021-08-25 20:22:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:50,218 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2021-08-25 20:22:50,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2021-08-25 20:22:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:22:50,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:50,220 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:50,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-25 20:22:50,220 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1833882926, now seen corresponding path program 1 times [2021-08-25 20:22:50,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:50,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956847844] [2021-08-25 20:22:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:50,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:22:50,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:50,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956847844] [2021-08-25 20:22:50,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956847844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:50,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:50,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:50,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562551633] [2021-08-25 20:22:50,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:50,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:50,264 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:50,469 INFO L93 Difference]: Finished difference Result 1583 states and 2401 transitions. [2021-08-25 20:22:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-25 20:22:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:50,472 INFO L225 Difference]: With dead ends: 1583 [2021-08-25 20:22:50,472 INFO L226 Difference]: Without dead ends: 817 [2021-08-25 20:22:50,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2021-08-25 20:22:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 787. [2021-08-25 20:22:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.515267175572519) internal successors, (1191), 786 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1191 transitions. [2021-08-25 20:22:50,489 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1191 transitions. Word has length 134 [2021-08-25 20:22:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:50,489 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1191 transitions. [2021-08-25 20:22:50,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1191 transitions. [2021-08-25 20:22:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:22:50,491 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:50,491 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:50,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-25 20:22:50,492 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash 373383698, now seen corresponding path program 1 times [2021-08-25 20:22:50,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:50,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135168403] [2021-08-25 20:22:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:50,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:50,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:50,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135168403] [2021-08-25 20:22:50,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135168403] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:50,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:50,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:50,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252943558] [2021-08-25 20:22:50,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:50,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:50,536 INFO L87 Difference]: Start difference. First operand 787 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:50,843 INFO L93 Difference]: Finished difference Result 1759 states and 2669 transitions. [2021-08-25 20:22:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-25 20:22:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:50,845 INFO L225 Difference]: With dead ends: 1759 [2021-08-25 20:22:50,845 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:50,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 811. [2021-08-25 20:22:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.5123456790123457) internal successors, (1225), 810 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1225 transitions. [2021-08-25 20:22:50,861 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1225 transitions. Word has length 134 [2021-08-25 20:22:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:50,861 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1225 transitions. [2021-08-25 20:22:50,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1225 transitions. [2021-08-25 20:22:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-08-25 20:22:50,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:50,862 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:50,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-25 20:22:50,863 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1043945135, now seen corresponding path program 1 times [2021-08-25 20:22:50,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:50,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830015858] [2021-08-25 20:22:50,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:50,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:50,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:50,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830015858] [2021-08-25 20:22:50,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830015858] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:50,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:50,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:50,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993333833] [2021-08-25 20:22:50,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:50,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:50,896 INFO L87 Difference]: Start difference. First operand 811 states and 1225 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:51,177 INFO L93 Difference]: Finished difference Result 1783 states and 2701 transitions. [2021-08-25 20:22:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-08-25 20:22:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:51,180 INFO L225 Difference]: With dead ends: 1783 [2021-08-25 20:22:51,180 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:51,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 813. [2021-08-25 20:22:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 1.5110837438423645) internal successors, (1227), 812 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1227 transitions. [2021-08-25 20:22:51,195 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1227 transitions. Word has length 135 [2021-08-25 20:22:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:51,195 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1227 transitions. [2021-08-25 20:22:51,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1227 transitions. [2021-08-25 20:22:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-25 20:22:51,196 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:51,196 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:51,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-25 20:22:51,196 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash 317716407, now seen corresponding path program 1 times [2021-08-25 20:22:51,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:51,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704606970] [2021-08-25 20:22:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:51,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:51,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:51,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704606970] [2021-08-25 20:22:51,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704606970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:51,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:51,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:51,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125466732] [2021-08-25 20:22:51,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:51,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:51,246 INFO L87 Difference]: Start difference. First operand 813 states and 1227 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:51,529 INFO L93 Difference]: Finished difference Result 1785 states and 2701 transitions. [2021-08-25 20:22:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2021-08-25 20:22:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:51,531 INFO L225 Difference]: With dead ends: 1785 [2021-08-25 20:22:51,531 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:51,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 815. [2021-08-25 20:22:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.50982800982801) internal successors, (1229), 814 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1229 transitions. [2021-08-25 20:22:51,546 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1229 transitions. Word has length 136 [2021-08-25 20:22:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:51,546 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1229 transitions. [2021-08-25 20:22:51,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1229 transitions. [2021-08-25 20:22:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:22:51,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:51,548 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:51,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-25 20:22:51,548 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash -759334476, now seen corresponding path program 1 times [2021-08-25 20:22:51,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:51,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771530403] [2021-08-25 20:22:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:51,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:51,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:51,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771530403] [2021-08-25 20:22:51,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771530403] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:51,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:51,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:51,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131571420] [2021-08-25 20:22:51,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:51,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:51,582 INFO L87 Difference]: Start difference. First operand 815 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:51,872 INFO L93 Difference]: Finished difference Result 1767 states and 2677 transitions. [2021-08-25 20:22:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:51,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-08-25 20:22:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:51,874 INFO L225 Difference]: With dead ends: 1767 [2021-08-25 20:22:51,874 INFO L226 Difference]: Without dead ends: 973 [2021-08-25 20:22:51,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-25 20:22:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 817. [2021-08-25 20:22:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.508578431372549) internal successors, (1231), 816 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1231 transitions. [2021-08-25 20:22:51,889 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1231 transitions. Word has length 137 [2021-08-25 20:22:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:51,889 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1231 transitions. [2021-08-25 20:22:51,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1231 transitions. [2021-08-25 20:22:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:22:51,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:51,891 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:51,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-25 20:22:51,891 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1295283003, now seen corresponding path program 1 times [2021-08-25 20:22:51,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:51,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079057644] [2021-08-25 20:22:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:51,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:51,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:51,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079057644] [2021-08-25 20:22:51,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079057644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:51,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:51,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:51,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470013919] [2021-08-25 20:22:51,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:51,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:51,927 INFO L87 Difference]: Start difference. First operand 817 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:52,242 INFO L93 Difference]: Finished difference Result 1789 states and 2701 transitions. [2021-08-25 20:22:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-08-25 20:22:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:52,244 INFO L225 Difference]: With dead ends: 1789 [2021-08-25 20:22:52,244 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:52,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2021-08-25 20:22:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.5061274509803921) internal successors, (1229), 816 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1229 transitions. [2021-08-25 20:22:52,276 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1229 transitions. Word has length 142 [2021-08-25 20:22:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:52,276 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1229 transitions. [2021-08-25 20:22:52,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1229 transitions. [2021-08-25 20:22:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-08-25 20:22:52,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:52,278 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:52,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-25 20:22:52,278 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash 854884956, now seen corresponding path program 1 times [2021-08-25 20:22:52,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:52,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039612675] [2021-08-25 20:22:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:52,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:52,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:52,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039612675] [2021-08-25 20:22:52,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039612675] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:52,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:52,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:52,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554713295] [2021-08-25 20:22:52,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:52,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:52,312 INFO L87 Difference]: Start difference. First operand 817 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:52,612 INFO L93 Difference]: Finished difference Result 1789 states and 2697 transitions. [2021-08-25 20:22:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:52,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2021-08-25 20:22:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:52,614 INFO L225 Difference]: With dead ends: 1789 [2021-08-25 20:22:52,614 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:52,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2021-08-25 20:22:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.5036764705882353) internal successors, (1227), 816 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1227 transitions. [2021-08-25 20:22:52,630 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1227 transitions. Word has length 143 [2021-08-25 20:22:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:52,630 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1227 transitions. [2021-08-25 20:22:52,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1227 transitions. [2021-08-25 20:22:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 20:22:52,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:52,631 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:52,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-25 20:22:52,632 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1248181846, now seen corresponding path program 1 times [2021-08-25 20:22:52,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:52,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332684892] [2021-08-25 20:22:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:52,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:52,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:52,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332684892] [2021-08-25 20:22:52,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332684892] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:52,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:52,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:52,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157790945] [2021-08-25 20:22:52,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:52,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:52,666 INFO L87 Difference]: Start difference. First operand 817 states and 1227 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:52,970 INFO L93 Difference]: Finished difference Result 1789 states and 2693 transitions. [2021-08-25 20:22:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-08-25 20:22:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:52,972 INFO L225 Difference]: With dead ends: 1789 [2021-08-25 20:22:52,972 INFO L226 Difference]: Without dead ends: 993 [2021-08-25 20:22:52,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-25 20:22:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2021-08-25 20:22:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.5012254901960784) internal successors, (1225), 816 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1225 transitions. [2021-08-25 20:22:52,994 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1225 transitions. Word has length 144 [2021-08-25 20:22:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:52,995 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1225 transitions. [2021-08-25 20:22:52,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1225 transitions. [2021-08-25 20:22:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 20:22:52,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:52,996 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:52,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-25 20:22:52,996 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash 283430609, now seen corresponding path program 1 times [2021-08-25 20:22:52,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:52,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118211007] [2021-08-25 20:22:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:52,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:53,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:53,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118211007] [2021-08-25 20:22:53,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118211007] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:53,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:53,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:53,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193987068] [2021-08-25 20:22:53,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:53,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:53,031 INFO L87 Difference]: Start difference. First operand 817 states and 1225 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:53,335 INFO L93 Difference]: Finished difference Result 1769 states and 2665 transitions. [2021-08-25 20:22:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-08-25 20:22:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:53,337 INFO L225 Difference]: With dead ends: 1769 [2021-08-25 20:22:53,337 INFO L226 Difference]: Without dead ends: 973 [2021-08-25 20:22:53,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-25 20:22:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 843. [2021-08-25 20:22:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.5142517814726841) internal successors, (1275), 842 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1275 transitions. [2021-08-25 20:22:53,357 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1275 transitions. Word has length 144 [2021-08-25 20:22:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:53,357 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1275 transitions. [2021-08-25 20:22:53,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1275 transitions. [2021-08-25 20:22:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:22:53,358 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:53,358 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:53,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-25 20:22:53,359 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2057540063, now seen corresponding path program 1 times [2021-08-25 20:22:53,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:53,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846125149] [2021-08-25 20:22:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:53,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:53,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:53,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846125149] [2021-08-25 20:22:53,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846125149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:53,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:53,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:53,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326856905] [2021-08-25 20:22:53,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:53,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:53,393 INFO L87 Difference]: Start difference. First operand 843 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:53,696 INFO L93 Difference]: Finished difference Result 1795 states and 2713 transitions. [2021-08-25 20:22:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2021-08-25 20:22:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:53,698 INFO L225 Difference]: With dead ends: 1795 [2021-08-25 20:22:53,698 INFO L226 Difference]: Without dead ends: 973 [2021-08-25 20:22:53,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-25 20:22:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 843. [2021-08-25 20:22:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.51187648456057) internal successors, (1273), 842 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1273 transitions. [2021-08-25 20:22:53,721 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1273 transitions. Word has length 145 [2021-08-25 20:22:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:53,721 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1273 transitions. [2021-08-25 20:22:53,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1273 transitions. [2021-08-25 20:22:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:22:53,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:53,723 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:53,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-25 20:22:53,723 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash 391170094, now seen corresponding path program 1 times [2021-08-25 20:22:53,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:53,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271516036] [2021-08-25 20:22:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:53,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:53,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:53,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271516036] [2021-08-25 20:22:53,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271516036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:53,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:53,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:53,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955955] [2021-08-25 20:22:53,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:53,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:53,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:53,781 INFO L87 Difference]: Start difference. First operand 843 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:54,071 INFO L93 Difference]: Finished difference Result 1779 states and 2683 transitions. [2021-08-25 20:22:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2021-08-25 20:22:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:54,072 INFO L225 Difference]: With dead ends: 1779 [2021-08-25 20:22:54,072 INFO L226 Difference]: Without dead ends: 957 [2021-08-25 20:22:54,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-25 20:22:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 845. [2021-08-25 20:22:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5106635071090047) internal successors, (1275), 844 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1275 transitions. [2021-08-25 20:22:54,089 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1275 transitions. Word has length 145 [2021-08-25 20:22:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:54,089 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1275 transitions. [2021-08-25 20:22:54,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1275 transitions. [2021-08-25 20:22:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:22:54,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:54,090 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:54,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-25 20:22:54,090 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1180027086, now seen corresponding path program 1 times [2021-08-25 20:22:54,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:54,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249240510] [2021-08-25 20:22:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:54,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:22:54,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:54,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249240510] [2021-08-25 20:22:54,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249240510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:54,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:54,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:54,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104149976] [2021-08-25 20:22:54,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:54,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:54,133 INFO L87 Difference]: Start difference. First operand 845 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:54,456 INFO L93 Difference]: Finished difference Result 1781 states and 2683 transitions. [2021-08-25 20:22:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:54,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-08-25 20:22:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:54,458 INFO L225 Difference]: With dead ends: 1781 [2021-08-25 20:22:54,458 INFO L226 Difference]: Without dead ends: 957 [2021-08-25 20:22:54,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-25 20:22:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 845. [2021-08-25 20:22:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5082938388625593) internal successors, (1273), 844 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1273 transitions. [2021-08-25 20:22:54,475 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1273 transitions. Word has length 147 [2021-08-25 20:22:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:54,475 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1273 transitions. [2021-08-25 20:22:54,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1273 transitions. [2021-08-25 20:22:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:22:54,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:54,477 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:54,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-25 20:22:54,477 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 986773621, now seen corresponding path program 1 times [2021-08-25 20:22:54,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:54,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773632592] [2021-08-25 20:22:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:54,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:22:54,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:54,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773632592] [2021-08-25 20:22:54,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773632592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:54,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:54,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:54,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823997577] [2021-08-25 20:22:54,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:54,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:54,512 INFO L87 Difference]: Start difference. First operand 845 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:54,756 INFO L93 Difference]: Finished difference Result 1777 states and 2675 transitions. [2021-08-25 20:22:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:54,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-08-25 20:22:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:54,758 INFO L225 Difference]: With dead ends: 1777 [2021-08-25 20:22:54,758 INFO L226 Difference]: Without dead ends: 953 [2021-08-25 20:22:54,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-08-25 20:22:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 845. [2021-08-25 20:22:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5059241706161137) internal successors, (1271), 844 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1271 transitions. [2021-08-25 20:22:54,775 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1271 transitions. Word has length 148 [2021-08-25 20:22:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:54,775 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1271 transitions. [2021-08-25 20:22:54,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1271 transitions. [2021-08-25 20:22:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:22:54,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:54,777 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:54,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-25 20:22:54,777 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1505929965, now seen corresponding path program 1 times [2021-08-25 20:22:54,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:54,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905693592] [2021-08-25 20:22:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:54,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:54,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:54,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905693592] [2021-08-25 20:22:54,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905693592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:54,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:54,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:54,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035400830] [2021-08-25 20:22:54,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:54,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:54,811 INFO L87 Difference]: Start difference. First operand 845 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:55,053 INFO L93 Difference]: Finished difference Result 1771 states and 2663 transitions. [2021-08-25 20:22:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-08-25 20:22:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:55,055 INFO L225 Difference]: With dead ends: 1771 [2021-08-25 20:22:55,055 INFO L226 Difference]: Without dead ends: 947 [2021-08-25 20:22:55,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-08-25 20:22:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 851. [2021-08-25 20:22:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.5070588235294118) internal successors, (1281), 850 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1281 transitions. [2021-08-25 20:22:55,073 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1281 transitions. Word has length 148 [2021-08-25 20:22:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:55,073 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1281 transitions. [2021-08-25 20:22:55,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1281 transitions. [2021-08-25 20:22:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:22:55,074 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:55,074 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:55,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-25 20:22:55,075 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -8676860, now seen corresponding path program 1 times [2021-08-25 20:22:55,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:55,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173401040] [2021-08-25 20:22:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:55,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:22:55,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:55,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173401040] [2021-08-25 20:22:55,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173401040] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:55,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:55,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:55,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958809533] [2021-08-25 20:22:55,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:55,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:55,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:55,138 INFO L87 Difference]: Start difference. First operand 851 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:55,403 INFO L93 Difference]: Finished difference Result 1751 states and 2631 transitions. [2021-08-25 20:22:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-08-25 20:22:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:55,405 INFO L225 Difference]: With dead ends: 1751 [2021-08-25 20:22:55,405 INFO L226 Difference]: Without dead ends: 921 [2021-08-25 20:22:55,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-08-25 20:22:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2021-08-25 20:22:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.5047058823529411) internal successors, (1279), 850 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1279 transitions. [2021-08-25 20:22:55,426 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1279 transitions. Word has length 148 [2021-08-25 20:22:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:55,426 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1279 transitions. [2021-08-25 20:22:55,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1279 transitions. [2021-08-25 20:22:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:22:55,427 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:55,427 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:55,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-25 20:22:55,428 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2084969725, now seen corresponding path program 1 times [2021-08-25 20:22:55,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:55,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754312915] [2021-08-25 20:22:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:55,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:22:55,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:55,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754312915] [2021-08-25 20:22:55,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754312915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:55,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:55,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:55,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253054253] [2021-08-25 20:22:55,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:55,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:55,465 INFO L87 Difference]: Start difference. First operand 851 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:55,715 INFO L93 Difference]: Finished difference Result 1751 states and 2627 transitions. [2021-08-25 20:22:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2021-08-25 20:22:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:55,717 INFO L225 Difference]: With dead ends: 1751 [2021-08-25 20:22:55,717 INFO L226 Difference]: Without dead ends: 921 [2021-08-25 20:22:55,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-08-25 20:22:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2021-08-25 20:22:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.5023529411764707) internal successors, (1277), 850 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1277 transitions. [2021-08-25 20:22:55,734 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1277 transitions. Word has length 149 [2021-08-25 20:22:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:55,735 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1277 transitions. [2021-08-25 20:22:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1277 transitions. [2021-08-25 20:22:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:22:55,736 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:55,736 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:55,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-25 20:22:55,736 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1770259671, now seen corresponding path program 1 times [2021-08-25 20:22:55,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:55,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711779697] [2021-08-25 20:22:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:55,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:22:55,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:55,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711779697] [2021-08-25 20:22:55,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711779697] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:55,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:55,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:55,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789494030] [2021-08-25 20:22:55,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:55,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:55,775 INFO L87 Difference]: Start difference. First operand 851 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:56,062 INFO L93 Difference]: Finished difference Result 1751 states and 2623 transitions. [2021-08-25 20:22:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:56,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2021-08-25 20:22:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:56,064 INFO L225 Difference]: With dead ends: 1751 [2021-08-25 20:22:56,064 INFO L226 Difference]: Without dead ends: 921 [2021-08-25 20:22:56,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-08-25 20:22:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2021-08-25 20:22:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.5) internal successors, (1275), 850 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1275 transitions. [2021-08-25 20:22:56,083 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1275 transitions. Word has length 150 [2021-08-25 20:22:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:56,083 INFO L470 AbstractCegarLoop]: Abstraction has 851 states and 1275 transitions. [2021-08-25 20:22:56,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1275 transitions. [2021-08-25 20:22:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-25 20:22:56,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:56,086 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:56,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-25 20:22:56,086 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1890867658, now seen corresponding path program 1 times [2021-08-25 20:22:56,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:56,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207248038] [2021-08-25 20:22:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:56,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:56,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:56,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207248038] [2021-08-25 20:22:56,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207248038] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:56,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:56,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:56,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689025135] [2021-08-25 20:22:56,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:56,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:56,134 INFO L87 Difference]: Start difference. First operand 851 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:56,386 INFO L93 Difference]: Finished difference Result 1777 states and 2659 transitions. [2021-08-25 20:22:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-08-25 20:22:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:56,388 INFO L225 Difference]: With dead ends: 1777 [2021-08-25 20:22:56,388 INFO L226 Difference]: Without dead ends: 947 [2021-08-25 20:22:56,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-08-25 20:22:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 853. [2021-08-25 20:22:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.4988262910798122) internal successors, (1277), 852 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1277 transitions. [2021-08-25 20:22:56,407 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1277 transitions. Word has length 151 [2021-08-25 20:22:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:56,408 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 1277 transitions. [2021-08-25 20:22:56,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1277 transitions. [2021-08-25 20:22:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-25 20:22:56,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:56,410 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:56,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-25 20:22:56,410 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1062083454, now seen corresponding path program 1 times [2021-08-25 20:22:56,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:56,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888242161] [2021-08-25 20:22:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:56,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:22:56,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:56,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888242161] [2021-08-25 20:22:56,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888242161] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:56,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:56,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:56,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544168091] [2021-08-25 20:22:56,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:56,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:56,453 INFO L87 Difference]: Start difference. First operand 853 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:56,689 INFO L93 Difference]: Finished difference Result 1735 states and 2599 transitions. [2021-08-25 20:22:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-08-25 20:22:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:56,691 INFO L225 Difference]: With dead ends: 1735 [2021-08-25 20:22:56,691 INFO L226 Difference]: Without dead ends: 903 [2021-08-25 20:22:56,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-08-25 20:22:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 853. [2021-08-25 20:22:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.4964788732394365) internal successors, (1275), 852 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1275 transitions. [2021-08-25 20:22:56,710 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1275 transitions. Word has length 151 [2021-08-25 20:22:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:56,711 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 1275 transitions. [2021-08-25 20:22:56,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1275 transitions. [2021-08-25 20:22:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:22:56,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:56,712 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:56,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-25 20:22:56,713 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1439992380, now seen corresponding path program 1 times [2021-08-25 20:22:56,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:56,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320401840] [2021-08-25 20:22:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:56,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:56,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:56,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320401840] [2021-08-25 20:22:56,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320401840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:56,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:56,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:56,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093081910] [2021-08-25 20:22:56,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:56,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:56,749 INFO L87 Difference]: Start difference. First operand 853 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:57,025 INFO L93 Difference]: Finished difference Result 1805 states and 2693 transitions. [2021-08-25 20:22:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-08-25 20:22:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:57,026 INFO L225 Difference]: With dead ends: 1805 [2021-08-25 20:22:57,026 INFO L226 Difference]: Without dead ends: 973 [2021-08-25 20:22:57,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-25 20:22:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 853. [2021-08-25 20:22:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.494131455399061) internal successors, (1273), 852 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1273 transitions. [2021-08-25 20:22:57,045 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1273 transitions. Word has length 152 [2021-08-25 20:22:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:57,045 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 1273 transitions. [2021-08-25 20:22:57,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1273 transitions. [2021-08-25 20:22:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:22:57,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:57,046 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:57,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-25 20:22:57,047 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1517573502, now seen corresponding path program 1 times [2021-08-25 20:22:57,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:57,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584938655] [2021-08-25 20:22:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:57,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:57,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:57,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584938655] [2021-08-25 20:22:57,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584938655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:57,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:57,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:57,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285379727] [2021-08-25 20:22:57,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:57,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:57,086 INFO L87 Difference]: Start difference. First operand 853 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:57,343 INFO L93 Difference]: Finished difference Result 1767 states and 2635 transitions. [2021-08-25 20:22:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-08-25 20:22:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:57,344 INFO L225 Difference]: With dead ends: 1767 [2021-08-25 20:22:57,344 INFO L226 Difference]: Without dead ends: 935 [2021-08-25 20:22:57,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-08-25 20:22:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 855. [2021-08-25 20:22:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.4929742388758782) internal successors, (1275), 854 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1275 transitions. [2021-08-25 20:22:57,364 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1275 transitions. Word has length 152 [2021-08-25 20:22:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:57,364 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1275 transitions. [2021-08-25 20:22:57,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1275 transitions. [2021-08-25 20:22:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:22:57,366 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:57,366 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:57,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-25 20:22:57,366 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 601030400, now seen corresponding path program 1 times [2021-08-25 20:22:57,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:57,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288423881] [2021-08-25 20:22:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:57,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:57,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:57,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288423881] [2021-08-25 20:22:57,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288423881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:57,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:57,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:57,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097327017] [2021-08-25 20:22:57,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:57,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:57,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:57,403 INFO L87 Difference]: Start difference. First operand 855 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:57,654 INFO L93 Difference]: Finished difference Result 1769 states and 2635 transitions. [2021-08-25 20:22:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:57,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-08-25 20:22:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:57,656 INFO L225 Difference]: With dead ends: 1769 [2021-08-25 20:22:57,656 INFO L226 Difference]: Without dead ends: 935 [2021-08-25 20:22:57,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-08-25 20:22:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 857. [2021-08-25 20:22:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.4918224299065421) internal successors, (1277), 856 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1277 transitions. [2021-08-25 20:22:57,683 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1277 transitions. Word has length 152 [2021-08-25 20:22:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:57,683 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1277 transitions. [2021-08-25 20:22:57,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1277 transitions. [2021-08-25 20:22:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:22:57,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:57,684 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:57,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-25 20:22:57,685 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:57,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1495335013, now seen corresponding path program 1 times [2021-08-25 20:22:57,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:57,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195900507] [2021-08-25 20:22:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:57,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:57,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:57,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195900507] [2021-08-25 20:22:57,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195900507] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:57,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:57,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:57,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173608779] [2021-08-25 20:22:57,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:57,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:57,720 INFO L87 Difference]: Start difference. First operand 857 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:58,024 INFO L93 Difference]: Finished difference Result 1793 states and 2663 transitions. [2021-08-25 20:22:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-08-25 20:22:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:58,025 INFO L225 Difference]: With dead ends: 1793 [2021-08-25 20:22:58,026 INFO L226 Difference]: Without dead ends: 957 [2021-08-25 20:22:58,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-25 20:22:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 857. [2021-08-25 20:22:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.4894859813084111) internal successors, (1275), 856 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1275 transitions. [2021-08-25 20:22:58,046 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1275 transitions. Word has length 153 [2021-08-25 20:22:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:58,046 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1275 transitions. [2021-08-25 20:22:58,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1275 transitions. [2021-08-25 20:22:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:22:58,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:58,048 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:58,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-25 20:22:58,048 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1853746152, now seen corresponding path program 1 times [2021-08-25 20:22:58,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:58,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210838841] [2021-08-25 20:22:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:58,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:58,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:58,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210838841] [2021-08-25 20:22:58,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210838841] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:58,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:58,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:58,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188365977] [2021-08-25 20:22:58,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:58,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:58,082 INFO L87 Difference]: Start difference. First operand 857 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:58,323 INFO L93 Difference]: Finished difference Result 1765 states and 2624 transitions. [2021-08-25 20:22:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-08-25 20:22:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:58,324 INFO L225 Difference]: With dead ends: 1765 [2021-08-25 20:22:58,324 INFO L226 Difference]: Without dead ends: 929 [2021-08-25 20:22:58,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-08-25 20:22:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 859. [2021-08-25 20:22:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.4883449883449884) internal successors, (1277), 858 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1277 transitions. [2021-08-25 20:22:58,368 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1277 transitions. Word has length 153 [2021-08-25 20:22:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:58,368 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1277 transitions. [2021-08-25 20:22:58,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1277 transitions. [2021-08-25 20:22:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:22:58,370 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:58,370 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:58,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-25 20:22:58,370 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash -789827000, now seen corresponding path program 1 times [2021-08-25 20:22:58,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:58,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588728347] [2021-08-25 20:22:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:58,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:58,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:58,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588728347] [2021-08-25 20:22:58,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588728347] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:58,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:58,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:58,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277921474] [2021-08-25 20:22:58,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:58,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:58,404 INFO L87 Difference]: Start difference. First operand 859 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:58,645 INFO L93 Difference]: Finished difference Result 1767 states and 2624 transitions. [2021-08-25 20:22:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-08-25 20:22:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:58,647 INFO L225 Difference]: With dead ends: 1767 [2021-08-25 20:22:58,647 INFO L226 Difference]: Without dead ends: 929 [2021-08-25 20:22:58,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-08-25 20:22:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 861. [2021-08-25 20:22:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.4872093023255815) internal successors, (1279), 860 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1279 transitions. [2021-08-25 20:22:58,668 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1279 transitions. Word has length 154 [2021-08-25 20:22:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:58,668 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1279 transitions. [2021-08-25 20:22:58,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1279 transitions. [2021-08-25 20:22:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:22:58,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:58,670 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:58,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-25 20:22:58,670 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1635236001, now seen corresponding path program 1 times [2021-08-25 20:22:58,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:58,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921346478] [2021-08-25 20:22:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:58,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:22:58,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:58,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921346478] [2021-08-25 20:22:58,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921346478] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:58,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:58,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:58,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005275944] [2021-08-25 20:22:58,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:58,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:58,706 INFO L87 Difference]: Start difference. First operand 861 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:58,974 INFO L93 Difference]: Finished difference Result 1797 states and 2659 transitions. [2021-08-25 20:22:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2021-08-25 20:22:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:58,976 INFO L225 Difference]: With dead ends: 1797 [2021-08-25 20:22:58,976 INFO L226 Difference]: Without dead ends: 957 [2021-08-25 20:22:58,976 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-25 20:22:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 861. [2021-08-25 20:22:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.4848837209302326) internal successors, (1277), 860 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1277 transitions. [2021-08-25 20:22:59,000 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1277 transitions. Word has length 155 [2021-08-25 20:22:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:59,000 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 1277 transitions. [2021-08-25 20:22:59,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1277 transitions. [2021-08-25 20:22:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:22:59,001 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:59,001 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:59,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-25 20:22:59,002 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1659649216, now seen corresponding path program 1 times [2021-08-25 20:22:59,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:59,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844681143] [2021-08-25 20:22:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:59,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:22:59,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:59,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844681143] [2021-08-25 20:22:59,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844681143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:59,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:59,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:59,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455717711] [2021-08-25 20:22:59,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:59,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:59,043 INFO L87 Difference]: Start difference. First operand 861 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:59,286 INFO L93 Difference]: Finished difference Result 1763 states and 2613 transitions. [2021-08-25 20:22:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2021-08-25 20:22:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:59,288 INFO L225 Difference]: With dead ends: 1763 [2021-08-25 20:22:59,288 INFO L226 Difference]: Without dead ends: 923 [2021-08-25 20:22:59,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-08-25 20:22:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 863. [2021-08-25 20:22:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4837587006960558) internal successors, (1279), 862 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1279 transitions. [2021-08-25 20:22:59,309 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1279 transitions. Word has length 155 [2021-08-25 20:22:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:59,309 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1279 transitions. [2021-08-25 20:22:59,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1279 transitions. [2021-08-25 20:22:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:22:59,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:59,310 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:59,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-25 20:22:59,311 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash -239800856, now seen corresponding path program 1 times [2021-08-25 20:22:59,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:59,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232439882] [2021-08-25 20:22:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:59,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:22:59,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:59,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232439882] [2021-08-25 20:22:59,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232439882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:59,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:59,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:59,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414308834] [2021-08-25 20:22:59,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:59,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:59,353 INFO L87 Difference]: Start difference. First operand 863 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:59,612 INFO L93 Difference]: Finished difference Result 1795 states and 2651 transitions. [2021-08-25 20:22:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-08-25 20:22:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:59,614 INFO L225 Difference]: With dead ends: 1795 [2021-08-25 20:22:59,614 INFO L226 Difference]: Without dead ends: 953 [2021-08-25 20:22:59,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-08-25 20:22:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 863. [2021-08-25 20:22:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4814385150812064) internal successors, (1277), 862 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1277 transitions. [2021-08-25 20:22:59,639 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1277 transitions. Word has length 156 [2021-08-25 20:22:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:59,639 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1277 transitions. [2021-08-25 20:22:59,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1277 transitions. [2021-08-25 20:22:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:22:59,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:59,641 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:59,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-25 20:22:59,641 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1562462854, now seen corresponding path program 1 times [2021-08-25 20:22:59,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:59,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961495744] [2021-08-25 20:22:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:59,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:22:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:22:59,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:22:59,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961495744] [2021-08-25 20:22:59,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961495744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:22:59,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:22:59,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:22:59,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109577841] [2021-08-25 20:22:59,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:22:59,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:22:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:22:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:22:59,679 INFO L87 Difference]: Start difference. First operand 863 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:22:59,947 INFO L93 Difference]: Finished difference Result 1789 states and 2639 transitions. [2021-08-25 20:22:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:22:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-08-25 20:22:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:22:59,949 INFO L225 Difference]: With dead ends: 1789 [2021-08-25 20:22:59,949 INFO L226 Difference]: Without dead ends: 947 [2021-08-25 20:22:59,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:22:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-08-25 20:22:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 863. [2021-08-25 20:22:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4791183294663572) internal successors, (1275), 862 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1275 transitions. [2021-08-25 20:22:59,974 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1275 transitions. Word has length 156 [2021-08-25 20:22:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:22:59,975 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1275 transitions. [2021-08-25 20:22:59,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:22:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1275 transitions. [2021-08-25 20:22:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-25 20:22:59,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:22:59,977 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:22:59,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-25 20:22:59,978 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:22:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:22:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 473382979, now seen corresponding path program 1 times [2021-08-25 20:22:59,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:22:59,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432903936] [2021-08-25 20:22:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:22:59,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:22:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:00,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:00,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432903936] [2021-08-25 20:23:00,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432903936] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:00,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:00,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:00,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480259182] [2021-08-25 20:23:00,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:00,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:00,016 INFO L87 Difference]: Start difference. First operand 863 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:00,333 INFO L93 Difference]: Finished difference Result 1839 states and 2731 transitions. [2021-08-25 20:23:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:00,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2021-08-25 20:23:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:00,335 INFO L225 Difference]: With dead ends: 1839 [2021-08-25 20:23:00,335 INFO L226 Difference]: Without dead ends: 997 [2021-08-25 20:23:00,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-08-25 20:23:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 923. [2021-08-25 20:23:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.497830802603037) internal successors, (1381), 922 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1381 transitions. [2021-08-25 20:23:00,360 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1381 transitions. Word has length 158 [2021-08-25 20:23:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:00,360 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1381 transitions. [2021-08-25 20:23:00,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1381 transitions. [2021-08-25 20:23:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:23:00,362 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:00,362 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:00,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-25 20:23:00,362 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:00,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1189357597, now seen corresponding path program 1 times [2021-08-25 20:23:00,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:00,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800810949] [2021-08-25 20:23:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:00,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:00,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:00,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800810949] [2021-08-25 20:23:00,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800810949] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:00,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:00,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:00,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410638721] [2021-08-25 20:23:00,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:00,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:00,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:00,410 INFO L87 Difference]: Start difference. First operand 923 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:00,713 INFO L93 Difference]: Finished difference Result 1909 states and 2847 transitions. [2021-08-25 20:23:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-25 20:23:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:00,714 INFO L225 Difference]: With dead ends: 1909 [2021-08-25 20:23:00,715 INFO L226 Difference]: Without dead ends: 1007 [2021-08-25 20:23:00,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-08-25 20:23:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 923. [2021-08-25 20:23:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4956616052060738) internal successors, (1379), 922 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1379 transitions. [2021-08-25 20:23:00,737 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1379 transitions. Word has length 159 [2021-08-25 20:23:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:00,737 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1379 transitions. [2021-08-25 20:23:00,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1379 transitions. [2021-08-25 20:23:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:23:00,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:00,739 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:00,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-08-25 20:23:00,739 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1789548913, now seen corresponding path program 1 times [2021-08-25 20:23:00,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:00,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924723384] [2021-08-25 20:23:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:00,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:00,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:00,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924723384] [2021-08-25 20:23:00,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924723384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:00,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:00,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:00,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923250436] [2021-08-25 20:23:00,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:00,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:00,775 INFO L87 Difference]: Start difference. First operand 923 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:01,026 INFO L93 Difference]: Finished difference Result 1897 states and 2827 transitions. [2021-08-25 20:23:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-08-25 20:23:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:01,028 INFO L225 Difference]: With dead ends: 1897 [2021-08-25 20:23:01,028 INFO L226 Difference]: Without dead ends: 995 [2021-08-25 20:23:01,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-08-25 20:23:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 923. [2021-08-25 20:23:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4934924078091105) internal successors, (1377), 922 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1377 transitions. [2021-08-25 20:23:01,052 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1377 transitions. Word has length 160 [2021-08-25 20:23:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:01,053 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1377 transitions. [2021-08-25 20:23:01,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1377 transitions. [2021-08-25 20:23:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:23:01,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:01,056 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:01,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-08-25 20:23:01,056 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash 873005811, now seen corresponding path program 1 times [2021-08-25 20:23:01,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:01,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601737856] [2021-08-25 20:23:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:01,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:01,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:01,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601737856] [2021-08-25 20:23:01,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601737856] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:01,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:01,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:01,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290704057] [2021-08-25 20:23:01,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:01,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:01,114 INFO L87 Difference]: Start difference. First operand 923 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:01,397 INFO L93 Difference]: Finished difference Result 1897 states and 2823 transitions. [2021-08-25 20:23:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:01,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-08-25 20:23:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:01,398 INFO L225 Difference]: With dead ends: 1897 [2021-08-25 20:23:01,399 INFO L226 Difference]: Without dead ends: 995 [2021-08-25 20:23:01,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-08-25 20:23:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 923. [2021-08-25 20:23:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4913232104121474) internal successors, (1375), 922 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1375 transitions. [2021-08-25 20:23:01,423 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1375 transitions. Word has length 160 [2021-08-25 20:23:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:01,423 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1375 transitions. [2021-08-25 20:23:01,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1375 transitions. [2021-08-25 20:23:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:23:01,424 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:01,425 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:01,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-08-25 20:23:01,425 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2012443003, now seen corresponding path program 1 times [2021-08-25 20:23:01,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:01,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780149594] [2021-08-25 20:23:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:01,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:01,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:01,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780149594] [2021-08-25 20:23:01,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780149594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:01,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:01,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:01,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184081374] [2021-08-25 20:23:01,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:01,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:01,468 INFO L87 Difference]: Start difference. First operand 923 states and 1375 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:01,718 INFO L93 Difference]: Finished difference Result 1891 states and 2812 transitions. [2021-08-25 20:23:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:23:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:01,720 INFO L225 Difference]: With dead ends: 1891 [2021-08-25 20:23:01,720 INFO L226 Difference]: Without dead ends: 989 [2021-08-25 20:23:01,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-08-25 20:23:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 923. [2021-08-25 20:23:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4891540130151844) internal successors, (1373), 922 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1373 transitions. [2021-08-25 20:23:01,743 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1373 transitions. Word has length 161 [2021-08-25 20:23:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:01,743 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1373 transitions. [2021-08-25 20:23:01,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1373 transitions. [2021-08-25 20:23:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:23:01,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:01,744 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:01,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-08-25 20:23:01,744 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1084196335, now seen corresponding path program 1 times [2021-08-25 20:23:01,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:01,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894681205] [2021-08-25 20:23:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:01,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:23:01,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:01,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894681205] [2021-08-25 20:23:01,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894681205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:01,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:01,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:01,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414022394] [2021-08-25 20:23:01,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:01,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:01,779 INFO L87 Difference]: Start difference. First operand 923 states and 1373 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:02,027 INFO L93 Difference]: Finished difference Result 1885 states and 2801 transitions. [2021-08-25 20:23:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:23:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:02,028 INFO L225 Difference]: With dead ends: 1885 [2021-08-25 20:23:02,029 INFO L226 Difference]: Without dead ends: 983 [2021-08-25 20:23:02,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-08-25 20:23:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 923. [2021-08-25 20:23:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4869848156182213) internal successors, (1371), 922 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1371 transitions. [2021-08-25 20:23:02,053 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1371 transitions. Word has length 161 [2021-08-25 20:23:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:02,053 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1371 transitions. [2021-08-25 20:23:02,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1371 transitions. [2021-08-25 20:23:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:23:02,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:02,054 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:02,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-08-25 20:23:02,054 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1219098752, now seen corresponding path program 1 times [2021-08-25 20:23:02,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:02,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640365036] [2021-08-25 20:23:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:02,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:23:02,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:02,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640365036] [2021-08-25 20:23:02,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640365036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:02,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:02,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:02,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154370985] [2021-08-25 20:23:02,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:02,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:02,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:02,091 INFO L87 Difference]: Start difference. First operand 923 states and 1371 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:02,334 INFO L93 Difference]: Finished difference Result 1875 states and 2787 transitions. [2021-08-25 20:23:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:02,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:23:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:02,336 INFO L225 Difference]: With dead ends: 1875 [2021-08-25 20:23:02,336 INFO L226 Difference]: Without dead ends: 973 [2021-08-25 20:23:02,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-25 20:23:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 923. [2021-08-25 20:23:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4848156182212582) internal successors, (1369), 922 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1369 transitions. [2021-08-25 20:23:02,366 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1369 transitions. Word has length 161 [2021-08-25 20:23:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:02,367 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1369 transitions. [2021-08-25 20:23:02,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1369 transitions. [2021-08-25 20:23:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-08-25 20:23:02,368 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:02,368 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:02,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-08-25 20:23:02,368 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1414462085, now seen corresponding path program 1 times [2021-08-25 20:23:02,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:02,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767372377] [2021-08-25 20:23:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:02,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:02,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:02,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767372377] [2021-08-25 20:23:02,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767372377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:02,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:02,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:02,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143770894] [2021-08-25 20:23:02,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:02,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:02,428 INFO L87 Difference]: Start difference. First operand 923 states and 1369 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:02,660 INFO L93 Difference]: Finished difference Result 1891 states and 2800 transitions. [2021-08-25 20:23:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2021-08-25 20:23:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:02,662 INFO L225 Difference]: With dead ends: 1891 [2021-08-25 20:23:02,662 INFO L226 Difference]: Without dead ends: 989 [2021-08-25 20:23:02,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-08-25 20:23:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 923. [2021-08-25 20:23:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.482646420824295) internal successors, (1367), 922 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1367 transitions. [2021-08-25 20:23:02,685 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1367 transitions. Word has length 162 [2021-08-25 20:23:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:02,685 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1367 transitions. [2021-08-25 20:23:02,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1367 transitions. [2021-08-25 20:23:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-08-25 20:23:02,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:02,686 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:02,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-08-25 20:23:02,687 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash -541964910, now seen corresponding path program 1 times [2021-08-25 20:23:02,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:02,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319392470] [2021-08-25 20:23:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:02,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:23:02,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:02,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319392470] [2021-08-25 20:23:02,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319392470] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:02,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:02,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:02,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170568399] [2021-08-25 20:23:02,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:02,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:02,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:02,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:02,721 INFO L87 Difference]: Start difference. First operand 923 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:02,948 INFO L93 Difference]: Finished difference Result 1881 states and 2785 transitions. [2021-08-25 20:23:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2021-08-25 20:23:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:02,949 INFO L225 Difference]: With dead ends: 1881 [2021-08-25 20:23:02,949 INFO L226 Difference]: Without dead ends: 979 [2021-08-25 20:23:02,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-08-25 20:23:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 923. [2021-08-25 20:23:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4804772234273318) internal successors, (1365), 922 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1365 transitions. [2021-08-25 20:23:02,973 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1365 transitions. Word has length 162 [2021-08-25 20:23:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:02,973 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1365 transitions. [2021-08-25 20:23:02,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1365 transitions. [2021-08-25 20:23:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-08-25 20:23:02,975 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:02,975 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:02,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-08-25 20:23:02,975 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1949736729, now seen corresponding path program 1 times [2021-08-25 20:23:02,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:02,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007850765] [2021-08-25 20:23:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:02,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:23:03,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:03,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007850765] [2021-08-25 20:23:03,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007850765] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:03,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:03,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:03,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727282799] [2021-08-25 20:23:03,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:03,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:03,012 INFO L87 Difference]: Start difference. First operand 923 states and 1365 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:03,252 INFO L93 Difference]: Finished difference Result 1871 states and 2771 transitions. [2021-08-25 20:23:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2021-08-25 20:23:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:03,254 INFO L225 Difference]: With dead ends: 1871 [2021-08-25 20:23:03,254 INFO L226 Difference]: Without dead ends: 969 [2021-08-25 20:23:03,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-08-25 20:23:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 923. [2021-08-25 20:23:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1363 transitions. [2021-08-25 20:23:03,277 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1363 transitions. Word has length 162 [2021-08-25 20:23:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:03,278 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1363 transitions. [2021-08-25 20:23:03,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1363 transitions. [2021-08-25 20:23:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-08-25 20:23:03,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:03,279 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:03,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-08-25 20:23:03,279 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash -524169235, now seen corresponding path program 1 times [2021-08-25 20:23:03,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:03,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336622122] [2021-08-25 20:23:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:03,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:23:03,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:03,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336622122] [2021-08-25 20:23:03,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336622122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:03,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:03,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:03,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516542457] [2021-08-25 20:23:03,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:03,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:03,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:03,331 INFO L87 Difference]: Start difference. First operand 923 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:03,598 INFO L93 Difference]: Finished difference Result 1885 states and 2781 transitions. [2021-08-25 20:23:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2021-08-25 20:23:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:03,600 INFO L225 Difference]: With dead ends: 1885 [2021-08-25 20:23:03,600 INFO L226 Difference]: Without dead ends: 983 [2021-08-25 20:23:03,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-08-25 20:23:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 909. [2021-08-25 20:23:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4834801762114538) internal successors, (1347), 908 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1347 transitions. [2021-08-25 20:23:03,624 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1347 transitions. Word has length 163 [2021-08-25 20:23:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:03,625 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1347 transitions. [2021-08-25 20:23:03,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1347 transitions. [2021-08-25 20:23:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:23:03,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:03,626 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:03,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-08-25 20:23:03,626 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1590245114, now seen corresponding path program 1 times [2021-08-25 20:23:03,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:03,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622701852] [2021-08-25 20:23:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:03,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:03,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:03,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622701852] [2021-08-25 20:23:03,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622701852] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:03,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:03,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:23:03,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639877431] [2021-08-25 20:23:03,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:23:03,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:23:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:03,752 INFO L87 Difference]: Start difference. First operand 909 states and 1347 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:04,146 INFO L93 Difference]: Finished difference Result 1955 states and 2911 transitions. [2021-08-25 20:23:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:23:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2021-08-25 20:23:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:04,147 INFO L225 Difference]: With dead ends: 1955 [2021-08-25 20:23:04,147 INFO L226 Difference]: Without dead ends: 1067 [2021-08-25 20:23:04,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:23:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-08-25 20:23:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 975. [2021-08-25 20:23:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.504106776180698) internal successors, (1465), 974 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1465 transitions. [2021-08-25 20:23:04,173 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1465 transitions. Word has length 164 [2021-08-25 20:23:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:04,173 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1465 transitions. [2021-08-25 20:23:04,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1465 transitions. [2021-08-25 20:23:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:23:04,175 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:04,175 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:04,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-08-25 20:23:04,175 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 363705902, now seen corresponding path program 1 times [2021-08-25 20:23:04,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:04,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011684330] [2021-08-25 20:23:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:04,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-25 20:23:04,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:04,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011684330] [2021-08-25 20:23:04,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011684330] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:04,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:04,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:23:04,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100635318] [2021-08-25 20:23:04,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:23:04,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:23:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:23:04,212 INFO L87 Difference]: Start difference. First operand 975 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:04,313 INFO L93 Difference]: Finished difference Result 2392 states and 3618 transitions. [2021-08-25 20:23:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:23:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2021-08-25 20:23:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:04,315 INFO L225 Difference]: With dead ends: 2392 [2021-08-25 20:23:04,315 INFO L226 Difference]: Without dead ends: 1438 [2021-08-25 20:23:04,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:23:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-08-25 20:23:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1431. [2021-08-25 20:23:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.5062937062937063) internal successors, (2154), 1430 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2154 transitions. [2021-08-25 20:23:04,380 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2154 transitions. Word has length 164 [2021-08-25 20:23:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:04,380 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 2154 transitions. [2021-08-25 20:23:04,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2154 transitions. [2021-08-25 20:23:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:23:04,382 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:04,382 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:04,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-08-25 20:23:04,382 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1821420005, now seen corresponding path program 1 times [2021-08-25 20:23:04,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:04,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468809529] [2021-08-25 20:23:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:04,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:23:04,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:04,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468809529] [2021-08-25 20:23:04,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468809529] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:04,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:04,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:04,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727978919] [2021-08-25 20:23:04,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:04,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:04,420 INFO L87 Difference]: Start difference. First operand 1431 states and 2154 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:04,692 INFO L93 Difference]: Finished difference Result 2946 states and 4417 transitions. [2021-08-25 20:23:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:04,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2021-08-25 20:23:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:04,694 INFO L225 Difference]: With dead ends: 2946 [2021-08-25 20:23:04,694 INFO L226 Difference]: Without dead ends: 1536 [2021-08-25 20:23:04,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-08-25 20:23:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1467. [2021-08-25 20:23:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 1.4979536152796726) internal successors, (2196), 1466 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2196 transitions. [2021-08-25 20:23:04,733 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2196 transitions. Word has length 165 [2021-08-25 20:23:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:04,733 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 2196 transitions. [2021-08-25 20:23:04,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2196 transitions. [2021-08-25 20:23:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:23:04,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:04,735 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:04,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-08-25 20:23:04,735 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2127321731, now seen corresponding path program 1 times [2021-08-25 20:23:04,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:04,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420169641] [2021-08-25 20:23:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:04,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:23:04,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:04,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420169641] [2021-08-25 20:23:04,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420169641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:04,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:04,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:04,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944117575] [2021-08-25 20:23:04,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:04,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:04,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:04,771 INFO L87 Difference]: Start difference. First operand 1467 states and 2196 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:05,047 INFO L93 Difference]: Finished difference Result 2964 states and 4434 transitions. [2021-08-25 20:23:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2021-08-25 20:23:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:05,049 INFO L225 Difference]: With dead ends: 2964 [2021-08-25 20:23:05,049 INFO L226 Difference]: Without dead ends: 1512 [2021-08-25 20:23:05,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2021-08-25 20:23:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1464. [2021-08-25 20:23:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4969241285030759) internal successors, (2190), 1463 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2190 transitions. [2021-08-25 20:23:05,089 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2190 transitions. Word has length 166 [2021-08-25 20:23:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:05,089 INFO L470 AbstractCegarLoop]: Abstraction has 1464 states and 2190 transitions. [2021-08-25 20:23:05,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2190 transitions. [2021-08-25 20:23:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-08-25 20:23:05,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:05,092 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:05,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-08-25 20:23:05,092 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash -885832868, now seen corresponding path program 1 times [2021-08-25 20:23:05,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:05,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587099103] [2021-08-25 20:23:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:05,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:23:05,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:05,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587099103] [2021-08-25 20:23:05,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587099103] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:05,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:05,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:05,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339146324] [2021-08-25 20:23:05,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:05,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:05,150 INFO L87 Difference]: Start difference. First operand 1464 states and 2190 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:05,440 INFO L93 Difference]: Finished difference Result 2991 states and 4468 transitions. [2021-08-25 20:23:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-08-25 20:23:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:05,442 INFO L225 Difference]: With dead ends: 2991 [2021-08-25 20:23:05,443 INFO L226 Difference]: Without dead ends: 1548 [2021-08-25 20:23:05,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-08-25 20:23:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1464. [2021-08-25 20:23:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4948735475051265) internal successors, (2187), 1463 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2187 transitions. [2021-08-25 20:23:05,496 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2187 transitions. Word has length 169 [2021-08-25 20:23:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:05,497 INFO L470 AbstractCegarLoop]: Abstraction has 1464 states and 2187 transitions. [2021-08-25 20:23:05,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2187 transitions. [2021-08-25 20:23:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-08-25 20:23:05,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:05,499 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:05,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-08-25 20:23:05,499 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1483328059, now seen corresponding path program 1 times [2021-08-25 20:23:05,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:05,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444444024] [2021-08-25 20:23:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:05,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:23:05,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:05,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444444024] [2021-08-25 20:23:05,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444444024] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:05,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:05,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:05,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605120492] [2021-08-25 20:23:05,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:05,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:05,542 INFO L87 Difference]: Start difference. First operand 1464 states and 2187 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:05,820 INFO L93 Difference]: Finished difference Result 2985 states and 4456 transitions. [2021-08-25 20:23:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2021-08-25 20:23:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:05,822 INFO L225 Difference]: With dead ends: 2985 [2021-08-25 20:23:05,822 INFO L226 Difference]: Without dead ends: 1542 [2021-08-25 20:23:05,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2021-08-25 20:23:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1464. [2021-08-25 20:23:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.492822966507177) internal successors, (2184), 1463 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2184 transitions. [2021-08-25 20:23:05,862 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2184 transitions. Word has length 170 [2021-08-25 20:23:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:05,862 INFO L470 AbstractCegarLoop]: Abstraction has 1464 states and 2184 transitions. [2021-08-25 20:23:05,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2184 transitions. [2021-08-25 20:23:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:23:05,864 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:05,864 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:05,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-08-25 20:23:05,864 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash 165451016, now seen corresponding path program 1 times [2021-08-25 20:23:05,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:05,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766316294] [2021-08-25 20:23:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:05,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:06,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:06,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766316294] [2021-08-25 20:23:06,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766316294] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:23:06,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464885961] [2021-08-25 20:23:06,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:06,252 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:23:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:23:06,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:23:06,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:23:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:06,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-25 20:23:06,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:06,706 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:23:06,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 99 [2021-08-25 20:23:06,748 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:06,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 80 [2021-08-25 20:23:06,802 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:06,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 61 [2021-08-25 20:23:06,808 INFO L354 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2021-08-25 20:23:06,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 88 [2021-08-25 20:23:06,973 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:06,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2021-08-25 20:23:07,289 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:07,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2021-08-25 20:23:07,349 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:07,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:23:07,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2021-08-25 20:23:07,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:23:07,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-08-25 20:23:07,965 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:07,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2021-08-25 20:23:08,016 INFO L354 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-08-25 20:23:08,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2021-08-25 20:23:08,720 INFO L354 Elim1Store]: treesize reduction 304, result has 12.4 percent of original size [2021-08-25 20:23:08,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 88 [2021-08-25 20:23:08,725 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:23:08,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2021-08-25 20:23:09,077 INFO L354 Elim1Store]: treesize reduction 324, result has 12.4 percent of original size [2021-08-25 20:23:09,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 144 treesize of output 98 [2021-08-25 20:23:09,130 INFO L354 Elim1Store]: treesize reduction 324, result has 12.4 percent of original size [2021-08-25 20:23:09,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 125 treesize of output 79 [2021-08-25 20:23:10,286 INFO L354 Elim1Store]: treesize reduction 324, result has 12.4 percent of original size [2021-08-25 20:23:10,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 125 treesize of output 79 [2021-08-25 20:23:10,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:10,388 INFO L354 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2021-08-25 20:23:10,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 62 [2021-08-25 20:23:10,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2021-08-25 20:23:10,404 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-25 20:23:10,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-08-25 20:23:10,450 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-25 20:23:10,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2021-08-25 20:23:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 72 proven. 116 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:23:10,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464885961] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:23:10,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:23:10,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2021-08-25 20:23:10,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572165407] [2021-08-25 20:23:10,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-25 20:23:10,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-25 20:23:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-08-25 20:23:10,930 INFO L87 Difference]: Start difference. First operand 1464 states and 2184 transitions. Second operand has 17 states, 17 states have (on average 18.941176470588236) internal successors, (322), 17 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:14,554 INFO L93 Difference]: Finished difference Result 4003 states and 5925 transitions. [2021-08-25 20:23:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-25 20:23:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.941176470588236) internal successors, (322), 17 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-08-25 20:23:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:14,557 INFO L225 Difference]: With dead ends: 4003 [2021-08-25 20:23:14,557 INFO L226 Difference]: Without dead ends: 2560 [2021-08-25 20:23:14,565 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 621.5ms TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2021-08-25 20:23:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2021-08-25 20:23:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1365. [2021-08-25 20:23:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.471407624633431) internal successors, (2007), 1364 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2007 transitions. [2021-08-25 20:23:14,643 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2007 transitions. Word has length 173 [2021-08-25 20:23:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:14,643 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2007 transitions. [2021-08-25 20:23:14,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.941176470588236) internal successors, (322), 17 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2007 transitions. [2021-08-25 20:23:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:23:14,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:14,645 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:14,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-25 20:23:14,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2021-08-25 20:23:14,861 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 931660317, now seen corresponding path program 1 times [2021-08-25 20:23:14,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:14,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779349828] [2021-08-25 20:23:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:14,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:14,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:14,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779349828] [2021-08-25 20:23:14,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779349828] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:14,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:14,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:14,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736444989] [2021-08-25 20:23:14,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:14,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:14,959 INFO L87 Difference]: Start difference. First operand 1365 states and 2007 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:15,290 INFO L93 Difference]: Finished difference Result 2820 states and 4137 transitions. [2021-08-25 20:23:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-08-25 20:23:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:15,292 INFO L225 Difference]: With dead ends: 2820 [2021-08-25 20:23:15,292 INFO L226 Difference]: Without dead ends: 1476 [2021-08-25 20:23:15,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-08-25 20:23:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1365. [2021-08-25 20:23:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.469208211143695) internal successors, (2004), 1364 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2004 transitions. [2021-08-25 20:23:15,340 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2004 transitions. Word has length 173 [2021-08-25 20:23:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:15,340 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2004 transitions. [2021-08-25 20:23:15,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2004 transitions. [2021-08-25 20:23:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-08-25 20:23:15,342 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:15,342 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:15,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-08-25 20:23:15,342 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1170651140, now seen corresponding path program 1 times [2021-08-25 20:23:15,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:15,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73015760] [2021-08-25 20:23:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:15,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:15,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:15,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73015760] [2021-08-25 20:23:15,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73015760] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:15,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:15,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:15,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615831623] [2021-08-25 20:23:15,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:15,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:15,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:15,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:15,383 INFO L87 Difference]: Start difference. First operand 1365 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:15,695 INFO L93 Difference]: Finished difference Result 2820 states and 4131 transitions. [2021-08-25 20:23:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2021-08-25 20:23:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:15,697 INFO L225 Difference]: With dead ends: 2820 [2021-08-25 20:23:15,697 INFO L226 Difference]: Without dead ends: 1476 [2021-08-25 20:23:15,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-08-25 20:23:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1365. [2021-08-25 20:23:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.467008797653959) internal successors, (2001), 1364 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2001 transitions. [2021-08-25 20:23:15,746 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2001 transitions. Word has length 174 [2021-08-25 20:23:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:15,747 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2001 transitions. [2021-08-25 20:23:15,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2001 transitions. [2021-08-25 20:23:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-08-25 20:23:15,748 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:15,748 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:15,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-08-25 20:23:15,748 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash -49364734, now seen corresponding path program 1 times [2021-08-25 20:23:15,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:15,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097706098] [2021-08-25 20:23:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:15,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:15,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:15,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097706098] [2021-08-25 20:23:15,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097706098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:15,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:15,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:15,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222937803] [2021-08-25 20:23:15,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:15,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:15,788 INFO L87 Difference]: Start difference. First operand 1365 states and 2001 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:16,104 INFO L93 Difference]: Finished difference Result 2820 states and 4125 transitions. [2021-08-25 20:23:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2021-08-25 20:23:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:16,106 INFO L225 Difference]: With dead ends: 2820 [2021-08-25 20:23:16,106 INFO L226 Difference]: Without dead ends: 1476 [2021-08-25 20:23:16,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-08-25 20:23:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1365. [2021-08-25 20:23:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.464809384164223) internal successors, (1998), 1364 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1998 transitions. [2021-08-25 20:23:16,159 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1998 transitions. Word has length 175 [2021-08-25 20:23:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:16,160 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 1998 transitions. [2021-08-25 20:23:16,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1998 transitions. [2021-08-25 20:23:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-25 20:23:16,161 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:16,161 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:16,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-08-25 20:23:16,162 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 746052041, now seen corresponding path program 1 times [2021-08-25 20:23:16,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:16,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511581042] [2021-08-25 20:23:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:16,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:16,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:16,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511581042] [2021-08-25 20:23:16,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511581042] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:16,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:16,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:23:16,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786452974] [2021-08-25 20:23:16,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:16,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:16,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:16,203 INFO L87 Difference]: Start difference. First operand 1365 states and 1998 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:16,531 INFO L93 Difference]: Finished difference Result 2790 states and 4083 transitions. [2021-08-25 20:23:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-08-25 20:23:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:16,533 INFO L225 Difference]: With dead ends: 2790 [2021-08-25 20:23:16,533 INFO L226 Difference]: Without dead ends: 1446 [2021-08-25 20:23:16,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-08-25 20:23:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1365. [2021-08-25 20:23:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.4626099706744868) internal successors, (1995), 1364 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1995 transitions. [2021-08-25 20:23:16,581 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1995 transitions. Word has length 176 [2021-08-25 20:23:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:16,581 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 1995 transitions. [2021-08-25 20:23:16,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1995 transitions. [2021-08-25 20:23:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-08-25 20:23:16,583 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:16,583 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:16,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-08-25 20:23:16,583 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2069660934, now seen corresponding path program 1 times [2021-08-25 20:23:16,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:16,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917019641] [2021-08-25 20:23:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:16,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:23:16,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:16,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917019641] [2021-08-25 20:23:16,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917019641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:16,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:16,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:23:16,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770733900] [2021-08-25 20:23:16,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:23:16,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:23:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:16,646 INFO L87 Difference]: Start difference. First operand 1365 states and 1995 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:17,041 INFO L93 Difference]: Finished difference Result 3173 states and 4694 transitions. [2021-08-25 20:23:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:17,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-08-25 20:23:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:17,043 INFO L225 Difference]: With dead ends: 3173 [2021-08-25 20:23:17,043 INFO L226 Difference]: Without dead ends: 1829 [2021-08-25 20:23:17,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2021-08-25 20:23:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1482. [2021-08-25 20:23:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1481 states have (on average 1.4908845374746793) internal successors, (2208), 1481 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2208 transitions. [2021-08-25 20:23:17,093 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2208 transitions. Word has length 179 [2021-08-25 20:23:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:17,094 INFO L470 AbstractCegarLoop]: Abstraction has 1482 states and 2208 transitions. [2021-08-25 20:23:17,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2208 transitions. [2021-08-25 20:23:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-08-25 20:23:17,095 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:17,095 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:17,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-08-25 20:23:17,095 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash 406872458, now seen corresponding path program 1 times [2021-08-25 20:23:17,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:17,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253104486] [2021-08-25 20:23:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:17,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:23:17,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:17,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253104486] [2021-08-25 20:23:17,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253104486] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:17,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:17,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:23:17,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345677378] [2021-08-25 20:23:17,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:23:17,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:23:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:17,166 INFO L87 Difference]: Start difference. First operand 1482 states and 2208 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:17,603 INFO L93 Difference]: Finished difference Result 3275 states and 4898 transitions. [2021-08-25 20:23:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:17,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-08-25 20:23:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:17,605 INFO L225 Difference]: With dead ends: 3275 [2021-08-25 20:23:17,605 INFO L226 Difference]: Without dead ends: 1814 [2021-08-25 20:23:17,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2021-08-25 20:23:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1563. [2021-08-25 20:23:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 1.5192061459667094) internal successors, (2373), 1562 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2373 transitions. [2021-08-25 20:23:17,657 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2373 transitions. Word has length 180 [2021-08-25 20:23:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:17,658 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2373 transitions. [2021-08-25 20:23:17,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2373 transitions. [2021-08-25 20:23:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-08-25 20:23:17,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:17,659 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:17,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-08-25 20:23:17,660 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1106098171, now seen corresponding path program 1 times [2021-08-25 20:23:17,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:17,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508742166] [2021-08-25 20:23:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:17,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 68 proven. 209 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:23:17,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:17,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508742166] [2021-08-25 20:23:17,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508742166] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:23:17,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545229517] [2021-08-25 20:23:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:17,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:23:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:23:17,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:23:17,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:23:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:18,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-25 20:23:18,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:18,508 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:23:18,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:23:18,518 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-08-25 20:23:18,527 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-25 20:23:18,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-25 20:23:18,558 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:18,613 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:18,639 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:23:18,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:23:18,703 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:18,715 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:18,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:18,794 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:23:18,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:23:18,903 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:23:18,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 94 [2021-08-25 20:23:18,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2021-08-25 20:23:18,915 INFO L354 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2021-08-25 20:23:18,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 65 [2021-08-25 20:23:18,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 7 [2021-08-25 20:23:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2021-08-25 20:23:19,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545229517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:19,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:23:19,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2021-08-25 20:23:19,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300604690] [2021-08-25 20:23:19,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:23:19,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:19,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:23:19,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-25 20:23:19,167 INFO L87 Difference]: Start difference. First operand 1563 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:19,929 INFO L93 Difference]: Finished difference Result 5901 states and 9016 transitions. [2021-08-25 20:23:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:23:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2021-08-25 20:23:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:19,934 INFO L225 Difference]: With dead ends: 5901 [2021-08-25 20:23:19,934 INFO L226 Difference]: Without dead ends: 4359 [2021-08-25 20:23:19,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-08-25 20:23:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2021-08-25 20:23:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 2813. [2021-08-25 20:23:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2812 states have (on average 1.5519203413940257) internal successors, (4364), 2812 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4364 transitions. [2021-08-25 20:23:20,041 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4364 transitions. Word has length 193 [2021-08-25 20:23:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:20,041 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 4364 transitions. [2021-08-25 20:23:20,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4364 transitions. [2021-08-25 20:23:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-08-25 20:23:20,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:20,044 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:20,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:20,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable120 [2021-08-25 20:23:20,257 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash 482816569, now seen corresponding path program 1 times [2021-08-25 20:23:20,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:23:20,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503155411] [2021-08-25 20:23:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:20,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:23:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:23:20,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:23:20,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503155411] [2021-08-25 20:23:20,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503155411] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:23:20,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198544987] [2021-08-25 20:23:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:20,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:23:20,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:23:20,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:23:20,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:23:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:21,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-25 20:23:21,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:21,267 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:23:21,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:23:21,278 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-08-25 20:23:21,288 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-25 20:23:21,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-25 20:23:21,315 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:21,369 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:21,403 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:23:21,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:23:21,470 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:21,482 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:23:21,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:23:21,563 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:23:21,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:23:21,638 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:23:21,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:23:21,674 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:23:21,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:23:21,763 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:23:21,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:23:21,818 INFO L354 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2021-08-25 20:23:21,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 275 treesize of output 205 [2021-08-25 20:23:21,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 215 [2021-08-25 20:23:21,838 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:21,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 287 [2021-08-25 20:23:21,885 INFO L354 Elim1Store]: treesize reduction 244, result has 13.2 percent of original size [2021-08-25 20:23:21,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 359 treesize of output 309 [2021-08-25 20:23:21,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-08-25 20:23:21,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:23:21,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-25 20:23:21,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373232196] [2021-08-25 20:23:21,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 20:23:21,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:23:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 20:23:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:23:21,893 INFO L87 Difference]: Start difference. First operand 2813 states and 4364 transitions. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 20:23:21,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:22,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:23:22,099 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1a2048b8 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-25 20:23:22,101 INFO L168 Benchmark]: Toolchain (without parser) took 53180.47 ms. Allocated memory was 50.3 MB in the beginning and 906.0 MB in the end (delta: 855.6 MB). Free memory was 25.0 MB in the beginning and 537.2 MB in the end (delta: -512.2 MB). Peak memory consumption was 342.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.4 MB in the end (delta: 25.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.75 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 24.8 MB in the beginning and 44.0 MB in the end (delta: -19.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.51 ms. Allocated memory is still 67.1 MB. Free memory was 44.0 MB in the beginning and 39.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 67.1 MB. Free memory was 39.4 MB in the beginning and 32.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: RCFGBuilder took 917.50 ms. Allocated memory was 67.1 MB in the beginning and 92.3 MB in the end (delta: 25.2 MB). Free memory was 32.3 MB in the beginning and 61.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,102 INFO L168 Benchmark]: TraceAbstraction took 51745.67 ms. Allocated memory was 92.3 MB in the beginning and 906.0 MB in the end (delta: 813.7 MB). Free memory was 60.8 MB in the beginning and 537.2 MB in the end (delta: -476.4 MB). Peak memory consumption was 335.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:23:22,103 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.15 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.4 MB in the end (delta: 25.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 420.75 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 24.8 MB in the beginning and 44.0 MB in the end (delta: -19.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.51 ms. Allocated memory is still 67.1 MB. Free memory was 44.0 MB in the beginning and 39.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 67.1 MB. Free memory was 39.4 MB in the beginning and 32.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 917.50 ms. Allocated memory was 67.1 MB in the beginning and 92.3 MB in the end (delta: 25.2 MB). Free memory was 32.3 MB in the beginning and 61.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 51745.67 ms. Allocated memory was 92.3 MB in the beginning and 906.0 MB in the end (delta: 813.7 MB). Free memory was 60.8 MB in the beginning and 537.2 MB in the end (delta: -476.4 MB). Peak memory consumption was 335.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1a2048b8 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1a2048b8: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-25 20:23:22,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:23:23,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:23:23,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:23:23,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:23:23,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:23:23,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:23:23,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:23:23,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:23:23,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:23:23,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:23:23,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:23:23,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:23:23,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:23:23,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:23:23,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:23:23,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:23:23,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:23:23,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:23:23,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:23:23,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:23:23,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:23:23,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:23:23,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:23:23,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:23:23,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:23:23,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:23:23,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:23:23,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:23:23,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:23:23,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:23:23,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:23:23,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:23:23,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:23:23,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:23:23,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:23:23,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:23:23,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:23:23,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:23:23,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:23:23,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:23:23,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:23:23,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:23:23,886 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:23:23,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:23:23,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:23:23,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:23:23,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:23:23,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:23:23,889 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:23:23,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:23:23,889 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:23:23,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:23:23,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:23:23,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:23:23,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:23:23,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:23:23,890 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:23:23,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:23:23,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:23:23,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:23:23,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:23:23,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:23:23,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:23:23,898 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:23:23,899 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:23:23,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:23:23,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:23:23,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:23:23,899 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6fd3beed33795904cd1581dde522a699edf165ce [2021-08-25 20:23:24,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:23:24,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:23:24,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:23:24,167 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:23:24,167 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:23:24,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:23:24,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9b2055d/32c16f4d0afb445ab30fbfc2d0272a23/FLAGfe5f1776c [2021-08-25 20:23:24,629 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:23:24,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:23:24,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9b2055d/32c16f4d0afb445ab30fbfc2d0272a23/FLAGfe5f1776c [2021-08-25 20:23:24,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9b2055d/32c16f4d0afb445ab30fbfc2d0272a23 [2021-08-25 20:23:24,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:23:24,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:23:24,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:23:24,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:23:24,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:23:24,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:23:24" (1/1) ... [2021-08-25 20:23:24,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc2ce3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:24, skipping insertion in model container [2021-08-25 20:23:24,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:23:24" (1/1) ... [2021-08-25 20:23:24,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:23:24,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:23:25,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] [2021-08-25 20:23:25,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:23:25,130 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:23:25,234 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] [2021-08-25 20:23:25,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:23:25,268 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:23:25,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25 WrapperNode [2021-08-25 20:23:25,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:23:25,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:23:25,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:23:25,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:23:25,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:23:25,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:23:25,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:23:25,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:23:25,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:23:25,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:23:25,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:23:25,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:23:25,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (1/1) ... [2021-08-25 20:23:25,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:23:25,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:23:25,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:23:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:23:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:23:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:23:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:23:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:23:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:23:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:23:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:23:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:23:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:23:25,742 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:23:26,837 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:23:26,837 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:23:26,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:23:26,842 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:23:26,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:23:26 BoogieIcfgContainer [2021-08-25 20:23:26,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:23:26,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:23:26,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:23:26,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:23:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:23:24" (1/3) ... [2021-08-25 20:23:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232331c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:23:26, skipping insertion in model container [2021-08-25 20:23:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:23:25" (2/3) ... [2021-08-25 20:23:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232331c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:23:26, skipping insertion in model container [2021-08-25 20:23:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:23:26" (3/3) ... [2021-08-25 20:23:26,848 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2021-08-25 20:23:26,851 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:23:26,851 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:23:26,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:23:26,890 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:23:26,890 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:23:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 157 states have (on average 1.7388535031847134) internal successors, (273), 158 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:23:26,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:26,911 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:26,911 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889119, now seen corresponding path program 1 times [2021-08-25 20:23:26,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:26,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614394184] [2021-08-25 20:23:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:26,924 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:26,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:26,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:26,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:23:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:27,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:23:27,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:27,148 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:27,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:23:27,193 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:23:27,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:23:27,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:27,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:27,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:27,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614394184] [2021-08-25 20:23:27,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614394184] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:27,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:27,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:23:27,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690351707] [2021-08-25 20:23:27,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:27,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:27,496 INFO L87 Difference]: Start difference. First operand has 159 states, 157 states have (on average 1.7388535031847134) internal successors, (273), 158 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:28,592 INFO L93 Difference]: Finished difference Result 345 states and 591 transitions. [2021-08-25 20:23:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:23:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:28,600 INFO L225 Difference]: With dead ends: 345 [2021-08-25 20:23:28,600 INFO L226 Difference]: Without dead ends: 174 [2021-08-25 20:23:28,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-25 20:23:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2021-08-25 20:23:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5897435897435896) internal successors, (248), 156 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2021-08-25 20:23:28,630 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 44 [2021-08-25 20:23:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:28,631 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2021-08-25 20:23:28,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2021-08-25 20:23:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:23:28,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:28,633 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:28,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:23:28,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:28,846 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash -829622597, now seen corresponding path program 1 times [2021-08-25 20:23:28,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:28,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311461571] [2021-08-25 20:23:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:28,848 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:28,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:28,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:23:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:29,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:23:29,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:29,077 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:29,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:23:29,139 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:23:29,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:23:29,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:29,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:29,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:29,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311461571] [2021-08-25 20:23:29,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311461571] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:29,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:29,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:29,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701277906] [2021-08-25 20:23:29,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:29,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:29,452 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:31,856 INFO L93 Difference]: Finished difference Result 439 states and 689 transitions. [2021-08-25 20:23:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-25 20:23:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:31,859 INFO L225 Difference]: With dead ends: 439 [2021-08-25 20:23:31,859 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:23:31,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:23:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 173. [2021-08-25 20:23:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.5872093023255813) internal successors, (273), 172 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2021-08-25 20:23:31,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 57 [2021-08-25 20:23:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:31,870 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2021-08-25 20:23:31,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2021-08-25 20:23:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:23:31,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:31,872 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:31,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:32,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:32,080 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash -44447127, now seen corresponding path program 1 times [2021-08-25 20:23:32,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:32,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998247556] [2021-08-25 20:23:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:32,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:32,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:32,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:23:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:32,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:32,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:32,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2021-08-25 20:23:32,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2021-08-25 20:23:33,139 INFO L354 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2021-08-25 20:23:33,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 31 [2021-08-25 20:23:33,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:33,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:33,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:33,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998247556] [2021-08-25 20:23:33,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998247556] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:33,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:33,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:23:33,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413619203] [2021-08-25 20:23:33,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:23:33,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:23:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:23:33,418 INFO L87 Difference]: Start difference. First operand 173 states and 273 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:35,300 INFO L93 Difference]: Finished difference Result 356 states and 560 transitions. [2021-08-25 20:23:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:23:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:23:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:35,302 INFO L225 Difference]: With dead ends: 356 [2021-08-25 20:23:35,302 INFO L226 Difference]: Without dead ends: 202 [2021-08-25 20:23:35,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:23:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-25 20:23:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2021-08-25 20:23:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.5904255319148937) internal successors, (299), 188 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2021-08-25 20:23:35,309 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 58 [2021-08-25 20:23:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:35,309 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2021-08-25 20:23:35,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2021-08-25 20:23:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:23:35,311 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:35,311 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:35,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:35,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:35,519 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1118306, now seen corresponding path program 1 times [2021-08-25 20:23:35,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:35,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823582493] [2021-08-25 20:23:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:35,521 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:35,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:35,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:35,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:23:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:35,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:23:35,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:35,828 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:35,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:23:35,860 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:23:35,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:23:35,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:36,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:36,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:36,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823582493] [2021-08-25 20:23:36,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823582493] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:36,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:36,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:36,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139618865] [2021-08-25 20:23:36,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:36,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:36,229 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:38,343 INFO L93 Difference]: Finished difference Result 485 states and 763 transitions. [2021-08-25 20:23:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:23:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:38,345 INFO L225 Difference]: With dead ends: 485 [2021-08-25 20:23:38,345 INFO L226 Difference]: Without dead ends: 315 [2021-08-25 20:23:38,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-25 20:23:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 190. [2021-08-25 20:23:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.582010582010582) internal successors, (299), 189 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 299 transitions. [2021-08-25 20:23:38,354 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 299 transitions. Word has length 58 [2021-08-25 20:23:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:38,354 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 299 transitions. [2021-08-25 20:23:38,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 299 transitions. [2021-08-25 20:23:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:23:38,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:38,355 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:38,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:38,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:38,564 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1969168478, now seen corresponding path program 1 times [2021-08-25 20:23:38,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:38,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371494250] [2021-08-25 20:23:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:38,565 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:38,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:38,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:23:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:38,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:38,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:38,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:38,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:39,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:39,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:39,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371494250] [2021-08-25 20:23:39,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371494250] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:39,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:39,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:39,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262750540] [2021-08-25 20:23:39,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:39,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:39,200 INFO L87 Difference]: Start difference. First operand 190 states and 299 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:41,779 INFO L93 Difference]: Finished difference Result 601 states and 947 transitions. [2021-08-25 20:23:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:23:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:41,781 INFO L225 Difference]: With dead ends: 601 [2021-08-25 20:23:41,781 INFO L226 Difference]: Without dead ends: 430 [2021-08-25 20:23:41,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-08-25 20:23:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 230. [2021-08-25 20:23:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6157205240174672) internal successors, (370), 229 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 370 transitions. [2021-08-25 20:23:41,788 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 370 transitions. Word has length 58 [2021-08-25 20:23:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:41,788 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 370 transitions. [2021-08-25 20:23:41,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 370 transitions. [2021-08-25 20:23:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:23:41,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:41,789 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:41,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:41,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:41,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:42,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1056532646, now seen corresponding path program 1 times [2021-08-25 20:23:42,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:42,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938074544] [2021-08-25 20:23:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:42,001 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:42,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:42,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:42,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:23:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:42,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:42,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:42,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:42,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:42,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:42,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:42,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938074544] [2021-08-25 20:23:42,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938074544] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:42,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:42,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:42,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951586915] [2021-08-25 20:23:42,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:42,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:42,675 INFO L87 Difference]: Start difference. First operand 230 states and 370 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:45,255 INFO L93 Difference]: Finished difference Result 654 states and 1047 transitions. [2021-08-25 20:23:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:23:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:45,258 INFO L225 Difference]: With dead ends: 654 [2021-08-25 20:23:45,258 INFO L226 Difference]: Without dead ends: 443 [2021-08-25 20:23:45,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-25 20:23:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 253. [2021-08-25 20:23:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.6468253968253967) internal successors, (415), 252 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 415 transitions. [2021-08-25 20:23:45,263 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 415 transitions. Word has length 59 [2021-08-25 20:23:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:45,264 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 415 transitions. [2021-08-25 20:23:45,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 415 transitions. [2021-08-25 20:23:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:23:45,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:45,265 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:45,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:45,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:45,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1468809309, now seen corresponding path program 1 times [2021-08-25 20:23:45,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:45,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855884943] [2021-08-25 20:23:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:45,467 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:45,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:45,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:45,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:23:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:45,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:45,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:45,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:45,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:46,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:46,310 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:46,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855884943] [2021-08-25 20:23:46,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855884943] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:46,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:46,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:46,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370306440] [2021-08-25 20:23:46,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:46,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:46,312 INFO L87 Difference]: Start difference. First operand 253 states and 415 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:49,756 INFO L93 Difference]: Finished difference Result 750 states and 1224 transitions. [2021-08-25 20:23:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:23:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:49,772 INFO L225 Difference]: With dead ends: 750 [2021-08-25 20:23:49,772 INFO L226 Difference]: Without dead ends: 516 [2021-08-25 20:23:49,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-08-25 20:23:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 317. [2021-08-25 20:23:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.6677215189873418) internal successors, (527), 316 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 527 transitions. [2021-08-25 20:23:49,779 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 527 transitions. Word has length 87 [2021-08-25 20:23:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:49,779 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 527 transitions. [2021-08-25 20:23:49,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 527 transitions. [2021-08-25 20:23:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-25 20:23:49,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:49,780 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:49,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:49,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:49,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash -639498598, now seen corresponding path program 1 times [2021-08-25 20:23:49,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:49,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438151893] [2021-08-25 20:23:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:49,990 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:49,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:49,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:23:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:50,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:50,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:50,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:50,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:50,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:51,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:51,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438151893] [2021-08-25 20:23:51,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438151893] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:51,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:51,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:51,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790231444] [2021-08-25 20:23:51,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:51,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:51,099 INFO L87 Difference]: Start difference. First operand 317 states and 527 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:54,383 INFO L93 Difference]: Finished difference Result 842 states and 1379 transitions. [2021-08-25 20:23:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-08-25 20:23:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:54,385 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:23:54,385 INFO L226 Difference]: Without dead ends: 544 [2021-08-25 20:23:54,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-25 20:23:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 354. [2021-08-25 20:23:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6742209631728044) internal successors, (591), 353 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 591 transitions. [2021-08-25 20:23:54,392 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 591 transitions. Word has length 93 [2021-08-25 20:23:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:54,392 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 591 transitions. [2021-08-25 20:23:54,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 591 transitions. [2021-08-25 20:23:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:23:54,393 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:54,393 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:54,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-08-25 20:23:54,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:54,594 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 879322610, now seen corresponding path program 1 times [2021-08-25 20:23:54,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:54,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419138414] [2021-08-25 20:23:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:54,595 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:54,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:54,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:23:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:55,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:23:55,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:55,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:23:55,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:23:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:55,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:23:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:23:55,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:23:55,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419138414] [2021-08-25 20:23:55,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419138414] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:23:55,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:23:55,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:23:55,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473936045] [2021-08-25 20:23:55,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:23:55,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:23:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:23:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:23:55,591 INFO L87 Difference]: Start difference. First operand 354 states and 591 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:23:59,146 INFO L93 Difference]: Finished difference Result 873 states and 1432 transitions. [2021-08-25 20:23:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:23:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-08-25 20:23:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:23:59,148 INFO L225 Difference]: With dead ends: 873 [2021-08-25 20:23:59,148 INFO L226 Difference]: Without dead ends: 538 [2021-08-25 20:23:59,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:23:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-25 20:23:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 354. [2021-08-25 20:23:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6685552407932012) internal successors, (589), 353 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 589 transitions. [2021-08-25 20:23:59,155 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 589 transitions. Word has length 94 [2021-08-25 20:23:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:23:59,155 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 589 transitions. [2021-08-25 20:23:59,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:23:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 589 transitions. [2021-08-25 20:23:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:23:59,156 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:23:59,156 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:23:59,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:23:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:23:59,365 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:23:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:23:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -484975122, now seen corresponding path program 1 times [2021-08-25 20:23:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:23:59,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841499020] [2021-08-25 20:23:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:23:59,366 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:23:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:23:59,367 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:23:59,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:23:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:23:59,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:23:59,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:23:59,912 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:23:59,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:23:59,940 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:23:59,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:23:59,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:00,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:00,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:00,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841499020] [2021-08-25 20:24:00,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841499020] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:00,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:00,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:00,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014091227] [2021-08-25 20:24:00,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:00,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:00,414 INFO L87 Difference]: Start difference. First operand 354 states and 589 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:02,544 INFO L93 Difference]: Finished difference Result 789 states and 1294 transitions. [2021-08-25 20:24:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:24:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:02,546 INFO L225 Difference]: With dead ends: 789 [2021-08-25 20:24:02,546 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:24:02,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:24:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2021-08-25 20:24:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6487252124645893) internal successors, (582), 353 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 582 transitions. [2021-08-25 20:24:02,553 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 582 transitions. Word has length 100 [2021-08-25 20:24:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:02,553 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 582 transitions. [2021-08-25 20:24:02,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 582 transitions. [2021-08-25 20:24:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:24:02,554 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:02,554 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:02,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:02,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:02,765 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1232825562, now seen corresponding path program 1 times [2021-08-25 20:24:02,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:02,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573327544] [2021-08-25 20:24:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:02,766 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:02,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:02,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:24:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:03,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:24:03,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:03,305 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:24:03,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:24:03,339 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:24:03,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:24:03,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:03,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:03,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:03,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573327544] [2021-08-25 20:24:03,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573327544] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:03,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:03,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:03,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366982583] [2021-08-25 20:24:03,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:03,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:03,822 INFO L87 Difference]: Start difference. First operand 354 states and 582 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:06,000 INFO L93 Difference]: Finished difference Result 789 states and 1281 transitions. [2021-08-25 20:24:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:06,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:24:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:06,002 INFO L225 Difference]: With dead ends: 789 [2021-08-25 20:24:06,002 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:24:06,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:24:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2021-08-25 20:24:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6288951841359773) internal successors, (575), 353 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 575 transitions. [2021-08-25 20:24:06,008 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 575 transitions. Word has length 100 [2021-08-25 20:24:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:06,008 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 575 transitions. [2021-08-25 20:24:06,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 575 transitions. [2021-08-25 20:24:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:24:06,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:06,009 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:06,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-25 20:24:06,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:06,218 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1165489495, now seen corresponding path program 1 times [2021-08-25 20:24:06,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:06,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828425214] [2021-08-25 20:24:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:06,220 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:06,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:06,226 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:06,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:24:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:06,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:24:06,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:06,914 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:24:06,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:24:06,943 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:24:06,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:24:06,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:07,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:07,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:07,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828425214] [2021-08-25 20:24:07,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828425214] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:07,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:07,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:07,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068690742] [2021-08-25 20:24:07,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:07,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:07,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:07,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:07,445 INFO L87 Difference]: Start difference. First operand 354 states and 575 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:10,185 INFO L93 Difference]: Finished difference Result 789 states and 1268 transitions. [2021-08-25 20:24:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:24:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:10,187 INFO L225 Difference]: With dead ends: 789 [2021-08-25 20:24:10,187 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:24:10,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:24:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2021-08-25 20:24:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6090651558073654) internal successors, (568), 353 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2021-08-25 20:24:10,193 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 101 [2021-08-25 20:24:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:10,193 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2021-08-25 20:24:10,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2021-08-25 20:24:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:24:10,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:10,194 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:10,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:10,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:10,395 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 204655220, now seen corresponding path program 1 times [2021-08-25 20:24:10,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:10,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726117558] [2021-08-25 20:24:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:10,396 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:10,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:24:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:11,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:11,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:11,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:11,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:24:11,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:24:11,616 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:11,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726117558] [2021-08-25 20:24:11,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726117558] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:11,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:11,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:11,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827818997] [2021-08-25 20:24:11,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:11,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:11,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:11,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:11,618 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:14,293 INFO L93 Difference]: Finished difference Result 911 states and 1448 transitions. [2021-08-25 20:24:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:24:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:14,296 INFO L225 Difference]: With dead ends: 911 [2021-08-25 20:24:14,296 INFO L226 Difference]: Without dead ends: 576 [2021-08-25 20:24:14,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-08-25 20:24:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 397. [2021-08-25 20:24:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.6111111111111112) internal successors, (638), 396 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 638 transitions. [2021-08-25 20:24:14,304 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 638 transitions. Word has length 101 [2021-08-25 20:24:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:14,305 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 638 transitions. [2021-08-25 20:24:14,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 638 transitions. [2021-08-25 20:24:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:24:14,306 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:14,306 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:14,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:14,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:14,515 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash -524237803, now seen corresponding path program 1 times [2021-08-25 20:24:14,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:14,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676614962] [2021-08-25 20:24:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:14,517 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:14,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:14,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 20:24:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:15,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:24:15,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:15,282 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:24:15,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:24:15,309 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:24:15,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:24:15,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:15,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:15,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:15,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676614962] [2021-08-25 20:24:15,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676614962] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:15,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:15,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:15,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601670024] [2021-08-25 20:24:15,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:15,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:15,918 INFO L87 Difference]: Start difference. First operand 397 states and 638 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:19,105 INFO L93 Difference]: Finished difference Result 875 states and 1395 transitions. [2021-08-25 20:24:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:24:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:19,107 INFO L225 Difference]: With dead ends: 875 [2021-08-25 20:24:19,107 INFO L226 Difference]: Without dead ends: 497 [2021-08-25 20:24:19,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-08-25 20:24:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 397. [2021-08-25 20:24:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.5909090909090908) internal successors, (630), 396 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2021-08-25 20:24:19,119 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 102 [2021-08-25 20:24:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:19,119 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2021-08-25 20:24:19,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2021-08-25 20:24:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:24:19,120 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:19,120 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:19,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:19,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:19,330 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1607914476, now seen corresponding path program 1 times [2021-08-25 20:24:19,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:19,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877776097] [2021-08-25 20:24:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:19,332 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:19,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:19,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:19,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 20:24:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:20,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:20,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:20,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:20,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:24:20,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:24:20,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:20,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877776097] [2021-08-25 20:24:20,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877776097] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:20,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:20,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:20,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686085502] [2021-08-25 20:24:20,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:20,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:20,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:20,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:20,723 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:23,323 INFO L93 Difference]: Finished difference Result 951 states and 1496 transitions. [2021-08-25 20:24:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:24:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:23,325 INFO L225 Difference]: With dead ends: 951 [2021-08-25 20:24:23,325 INFO L226 Difference]: Without dead ends: 569 [2021-08-25 20:24:23,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-25 20:24:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 399. [2021-08-25 20:24:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.5904522613065326) internal successors, (633), 398 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 633 transitions. [2021-08-25 20:24:23,332 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 633 transitions. Word has length 102 [2021-08-25 20:24:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:23,332 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 633 transitions. [2021-08-25 20:24:23,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 633 transitions. [2021-08-25 20:24:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:24:23,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:23,334 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:23,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:23,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:23,543 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash -968485710, now seen corresponding path program 1 times [2021-08-25 20:24:23,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:23,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66162227] [2021-08-25 20:24:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:23,544 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:23,545 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:23,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 20:24:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:24,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:24:24,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:24,424 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:24:24,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:24:24,469 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:24:24,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:24:24,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:24,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:24:25,043 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:25,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66162227] [2021-08-25 20:24:25,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66162227] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:25,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:25,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:25,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127355166] [2021-08-25 20:24:25,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:25,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:25,044 INFO L87 Difference]: Start difference. First operand 399 states and 633 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:26,786 INFO L93 Difference]: Finished difference Result 855 states and 1353 transitions. [2021-08-25 20:24:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:24:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:26,788 INFO L225 Difference]: With dead ends: 855 [2021-08-25 20:24:26,788 INFO L226 Difference]: Without dead ends: 475 [2021-08-25 20:24:26,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-08-25 20:24:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 399. [2021-08-25 20:24:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 625 transitions. [2021-08-25 20:24:26,828 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 625 transitions. Word has length 103 [2021-08-25 20:24:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:26,828 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 625 transitions. [2021-08-25 20:24:26,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 625 transitions. [2021-08-25 20:24:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:24:26,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:26,830 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:26,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:27,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:27,031 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash 884501920, now seen corresponding path program 1 times [2021-08-25 20:24:27,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:27,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853857606] [2021-08-25 20:24:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:27,032 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:27,033 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:27,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 20:24:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:27,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:27,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:27,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:27,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:28,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:28,464 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:28,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853857606] [2021-08-25 20:24:28,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853857606] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:28,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:28,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:28,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118623287] [2021-08-25 20:24:28,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:28,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:28,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:28,466 INFO L87 Difference]: Start difference. First operand 399 states and 625 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:31,169 INFO L93 Difference]: Finished difference Result 971 states and 1516 transitions. [2021-08-25 20:24:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:31,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-08-25 20:24:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:31,171 INFO L225 Difference]: With dead ends: 971 [2021-08-25 20:24:31,171 INFO L226 Difference]: Without dead ends: 591 [2021-08-25 20:24:31,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-08-25 20:24:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 429. [2021-08-25 20:24:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.558411214953271) internal successors, (667), 428 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 667 transitions. [2021-08-25 20:24:31,179 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 667 transitions. Word has length 114 [2021-08-25 20:24:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:31,179 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 667 transitions. [2021-08-25 20:24:31,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 667 transitions. [2021-08-25 20:24:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:24:31,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:31,180 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:31,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:31,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:31,389 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash 794692387, now seen corresponding path program 1 times [2021-08-25 20:24:31,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:31,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187069022] [2021-08-25 20:24:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:31,390 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:31,405 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:31,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-25 20:24:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:32,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:32,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:32,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:32,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:32,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:33,017 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:33,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187069022] [2021-08-25 20:24:33,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187069022] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:33,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:33,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:33,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965660618] [2021-08-25 20:24:33,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:33,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:33,019 INFO L87 Difference]: Start difference. First operand 429 states and 667 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:35,593 INFO L93 Difference]: Finished difference Result 987 states and 1531 transitions. [2021-08-25 20:24:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-25 20:24:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:35,596 INFO L225 Difference]: With dead ends: 987 [2021-08-25 20:24:35,596 INFO L226 Difference]: Without dead ends: 577 [2021-08-25 20:24:35,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-08-25 20:24:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 429. [2021-08-25 20:24:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.544392523364486) internal successors, (661), 428 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 661 transitions. [2021-08-25 20:24:35,603 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 661 transitions. Word has length 115 [2021-08-25 20:24:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:35,603 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 661 transitions. [2021-08-25 20:24:35,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 661 transitions. [2021-08-25 20:24:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-25 20:24:35,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:35,604 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:35,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:35,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:35,814 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2025819035, now seen corresponding path program 1 times [2021-08-25 20:24:35,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:35,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852581308] [2021-08-25 20:24:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:35,815 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:35,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:35,816 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:35,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-25 20:24:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:36,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:36,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:36,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:36,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:37,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:37,431 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:37,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852581308] [2021-08-25 20:24:37,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852581308] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:37,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:37,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:37,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905553310] [2021-08-25 20:24:37,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:37,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:37,433 INFO L87 Difference]: Start difference. First operand 429 states and 661 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:40,334 INFO L93 Difference]: Finished difference Result 1029 states and 1582 transitions. [2021-08-25 20:24:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-08-25 20:24:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:40,337 INFO L225 Difference]: With dead ends: 1029 [2021-08-25 20:24:40,337 INFO L226 Difference]: Without dead ends: 619 [2021-08-25 20:24:40,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-08-25 20:24:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2021-08-25 20:24:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.530701754385965) internal successors, (698), 456 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 698 transitions. [2021-08-25 20:24:40,345 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 698 transitions. Word has length 118 [2021-08-25 20:24:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:40,345 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 698 transitions. [2021-08-25 20:24:40,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 698 transitions. [2021-08-25 20:24:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:24:40,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:40,346 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:40,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:40,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:40,556 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash -167226306, now seen corresponding path program 1 times [2021-08-25 20:24:40,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:40,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502472886] [2021-08-25 20:24:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:40,557 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:40,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:40,566 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:40,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-25 20:24:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:41,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:41,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:41,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:41,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:42,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:24:42,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:42,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502472886] [2021-08-25 20:24:42,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502472886] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:42,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:42,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:42,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561827660] [2021-08-25 20:24:42,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:42,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:42,374 INFO L87 Difference]: Start difference. First operand 457 states and 698 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:46,130 INFO L93 Difference]: Finished difference Result 1035 states and 1578 transitions. [2021-08-25 20:24:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-25 20:24:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:46,132 INFO L225 Difference]: With dead ends: 1035 [2021-08-25 20:24:46,132 INFO L226 Difference]: Without dead ends: 597 [2021-08-25 20:24:46,132 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-08-25 20:24:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 457. [2021-08-25 20:24:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.5153508771929824) internal successors, (691), 456 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 691 transitions. [2021-08-25 20:24:46,139 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 691 transitions. Word has length 119 [2021-08-25 20:24:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:46,139 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 691 transitions. [2021-08-25 20:24:46,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 691 transitions. [2021-08-25 20:24:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-08-25 20:24:46,140 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:46,140 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:46,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:46,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:46,341 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 326363942, now seen corresponding path program 1 times [2021-08-25 20:24:46,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:46,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259848446] [2021-08-25 20:24:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:46,342 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:46,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:46,343 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:46,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-25 20:24:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:47,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:47,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:47,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:47,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:24:47,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:24:48,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:48,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259848446] [2021-08-25 20:24:48,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259848446] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:48,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:48,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:48,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629513116] [2021-08-25 20:24:48,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:48,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:48,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:48,200 INFO L87 Difference]: Start difference. First operand 457 states and 691 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:50,945 INFO L93 Difference]: Finished difference Result 1077 states and 1625 transitions. [2021-08-25 20:24:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:50,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2021-08-25 20:24:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:50,947 INFO L225 Difference]: With dead ends: 1077 [2021-08-25 20:24:50,947 INFO L226 Difference]: Without dead ends: 639 [2021-08-25 20:24:50,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-08-25 20:24:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 492. [2021-08-25 20:24:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.5071283095723014) internal successors, (740), 491 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 740 transitions. [2021-08-25 20:24:50,956 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 740 transitions. Word has length 126 [2021-08-25 20:24:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:50,956 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 740 transitions. [2021-08-25 20:24:50,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 740 transitions. [2021-08-25 20:24:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-25 20:24:50,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:50,957 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:50,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:51,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:51,168 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1318009298, now seen corresponding path program 1 times [2021-08-25 20:24:51,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:51,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459524945] [2021-08-25 20:24:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:51,169 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:51,170 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-25 20:24:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:52,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:52,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:52,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:52,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:24:52,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:24:53,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:53,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459524945] [2021-08-25 20:24:53,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459524945] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:53,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:53,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:53,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478868712] [2021-08-25 20:24:53,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:53,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:53,029 INFO L87 Difference]: Start difference. First operand 492 states and 740 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:24:55,800 INFO L93 Difference]: Finished difference Result 1102 states and 1656 transitions. [2021-08-25 20:24:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:24:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-08-25 20:24:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:24:55,802 INFO L225 Difference]: With dead ends: 1102 [2021-08-25 20:24:55,802 INFO L226 Difference]: Without dead ends: 629 [2021-08-25 20:24:55,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:24:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-08-25 20:24:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 492. [2021-08-25 20:24:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4989816700610998) internal successors, (736), 491 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 736 transitions. [2021-08-25 20:24:55,823 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 736 transitions. Word has length 127 [2021-08-25 20:24:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:24:55,823 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 736 transitions. [2021-08-25 20:24:55,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:24:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 736 transitions. [2021-08-25 20:24:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:24:55,824 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:24:55,824 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:24:55,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-25 20:24:56,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:24:56,025 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:24:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:24:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -743913870, now seen corresponding path program 1 times [2021-08-25 20:24:56,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:24:56,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115564231] [2021-08-25 20:24:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:24:56,026 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:24:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:24:56,027 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:24:56,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-25 20:24:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:24:57,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:24:57,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:24:57,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:24:57,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:24:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:24:57,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:24:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:24:58,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:24:58,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115564231] [2021-08-25 20:24:58,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115564231] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:24:58,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:24:58,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:24:58,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084934017] [2021-08-25 20:24:58,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:24:58,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:24:58,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:24:58,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:24:58,059 INFO L87 Difference]: Start difference. First operand 492 states and 736 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:00,689 INFO L93 Difference]: Finished difference Result 1145 states and 1708 transitions. [2021-08-25 20:25:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-08-25 20:25:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:00,692 INFO L225 Difference]: With dead ends: 1145 [2021-08-25 20:25:00,692 INFO L226 Difference]: Without dead ends: 672 [2021-08-25 20:25:00,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-08-25 20:25:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 535. [2021-08-25 20:25:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4887640449438202) internal successors, (795), 534 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 795 transitions. [2021-08-25 20:25:00,719 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 795 transitions. Word has length 142 [2021-08-25 20:25:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:00,719 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 795 transitions. [2021-08-25 20:25:00,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 795 transitions. [2021-08-25 20:25:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-08-25 20:25:00,720 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:00,720 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:00,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-08-25 20:25:00,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:00,932 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -630654118, now seen corresponding path program 1 times [2021-08-25 20:25:00,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:00,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665868326] [2021-08-25 20:25:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:00,932 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:00,935 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:00,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-25 20:25:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:02,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:02,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:02,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:02,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:25:02,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:25:03,215 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:03,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665868326] [2021-08-25 20:25:03,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665868326] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:03,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:03,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:03,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242097664] [2021-08-25 20:25:03,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:03,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:03,217 INFO L87 Difference]: Start difference. First operand 535 states and 795 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:06,173 INFO L93 Difference]: Finished difference Result 1186 states and 1762 transitions. [2021-08-25 20:25:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2021-08-25 20:25:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:06,176 INFO L225 Difference]: With dead ends: 1186 [2021-08-25 20:25:06,176 INFO L226 Difference]: Without dead ends: 654 [2021-08-25 20:25:06,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-08-25 20:25:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 527. [2021-08-25 20:25:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.484790874524715) internal successors, (781), 526 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2021-08-25 20:25:06,190 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 143 [2021-08-25 20:25:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:06,191 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2021-08-25 20:25:06,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2021-08-25 20:25:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-25 20:25:06,192 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:06,192 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:06,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:06,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:06,404 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -356606618, now seen corresponding path program 1 times [2021-08-25 20:25:06,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:06,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000760842] [2021-08-25 20:25:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:06,406 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:06,407 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:06,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-25 20:25:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:07,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:07,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:08,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:25:08,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:25:08,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:08,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000760842] [2021-08-25 20:25:08,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000760842] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:08,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:08,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:08,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001050829] [2021-08-25 20:25:08,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:08,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:08,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:08,755 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:11,806 INFO L93 Difference]: Finished difference Result 1196 states and 1775 transitions. [2021-08-25 20:25:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2021-08-25 20:25:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:11,809 INFO L225 Difference]: With dead ends: 1196 [2021-08-25 20:25:11,809 INFO L226 Difference]: Without dead ends: 688 [2021-08-25 20:25:11,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-08-25 20:25:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 553. [2021-08-25 20:25:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4692028985507246) internal successors, (811), 552 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2021-08-25 20:25:11,824 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 146 [2021-08-25 20:25:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:11,824 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2021-08-25 20:25:11,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2021-08-25 20:25:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:25:11,826 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:11,826 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:11,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-08-25 20:25:12,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:12,036 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2139901911, now seen corresponding path program 1 times [2021-08-25 20:25:12,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:12,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66653248] [2021-08-25 20:25:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:12,038 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:12,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:12,038 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:12,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-25 20:25:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:13,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:13,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:13,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:13,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:25:13,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:25:14,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:14,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66653248] [2021-08-25 20:25:14,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66653248] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:14,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:14,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:14,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774445043] [2021-08-25 20:25:14,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:14,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:14,332 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:16,931 INFO L93 Difference]: Finished difference Result 1212 states and 1781 transitions. [2021-08-25 20:25:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-08-25 20:25:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:16,934 INFO L225 Difference]: With dead ends: 1212 [2021-08-25 20:25:16,934 INFO L226 Difference]: Without dead ends: 678 [2021-08-25 20:25:16,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-08-25 20:25:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 553. [2021-08-25 20:25:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.451086956521739) internal successors, (801), 552 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 801 transitions. [2021-08-25 20:25:16,944 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 801 transitions. Word has length 147 [2021-08-25 20:25:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:16,944 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 801 transitions. [2021-08-25 20:25:16,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 801 transitions. [2021-08-25 20:25:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:25:16,945 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:16,945 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:16,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:17,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:17,146 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1509603254, now seen corresponding path program 1 times [2021-08-25 20:25:17,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:17,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391054633] [2021-08-25 20:25:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:17,147 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:17,150 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:17,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-25 20:25:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:18,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:18,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:18,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:18,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:25:19,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:25:19,540 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:19,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391054633] [2021-08-25 20:25:19,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391054633] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:19,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:19,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:19,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13897742] [2021-08-25 20:25:19,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:19,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:19,541 INFO L87 Difference]: Start difference. First operand 553 states and 801 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:22,086 INFO L93 Difference]: Finished difference Result 1246 states and 1809 transitions. [2021-08-25 20:25:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:22,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-08-25 20:25:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:22,088 INFO L225 Difference]: With dead ends: 1246 [2021-08-25 20:25:22,088 INFO L226 Difference]: Without dead ends: 712 [2021-08-25 20:25:22,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-08-25 20:25:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 586. [2021-08-25 20:25:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.441025641025641) internal successors, (843), 585 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 843 transitions. [2021-08-25 20:25:22,099 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 843 transitions. Word has length 160 [2021-08-25 20:25:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:22,100 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 843 transitions. [2021-08-25 20:25:22,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 843 transitions. [2021-08-25 20:25:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:25:22,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:22,101 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:22,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:22,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:22,312 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -266629090, now seen corresponding path program 1 times [2021-08-25 20:25:22,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:22,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154919850] [2021-08-25 20:25:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:22,314 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:22,315 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:22,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-08-25 20:25:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:23,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:23,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:23,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:24,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:25:24,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:25:24,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:24,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154919850] [2021-08-25 20:25:24,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154919850] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:24,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:24,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:24,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261472585] [2021-08-25 20:25:24,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:24,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:24,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:24,675 INFO L87 Difference]: Start difference. First operand 586 states and 843 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:26,985 INFO L93 Difference]: Finished difference Result 1272 states and 1834 transitions. [2021-08-25 20:25:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:26,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:25:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:26,989 INFO L225 Difference]: With dead ends: 1272 [2021-08-25 20:25:26,989 INFO L226 Difference]: Without dead ends: 687 [2021-08-25 20:25:26,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-08-25 20:25:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 577. [2021-08-25 20:25:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4288194444444444) internal successors, (823), 576 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 823 transitions. [2021-08-25 20:25:27,013 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 823 transitions. Word has length 161 [2021-08-25 20:25:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:27,014 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 823 transitions. [2021-08-25 20:25:27,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 823 transitions. [2021-08-25 20:25:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:25:27,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:27,015 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:27,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:27,227 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash 888451936, now seen corresponding path program 1 times [2021-08-25 20:25:27,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:27,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693552400] [2021-08-25 20:25:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:27,228 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:27,229 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:27,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-08-25 20:25:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:28,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:28,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:28,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:29,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:29,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:29,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:29,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693552400] [2021-08-25 20:25:29,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693552400] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:29,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:29,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:29,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778142319] [2021-08-25 20:25:29,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:29,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:29,747 INFO L87 Difference]: Start difference. First operand 577 states and 823 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:31,888 INFO L93 Difference]: Finished difference Result 1270 states and 1821 transitions. [2021-08-25 20:25:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2021-08-25 20:25:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:31,891 INFO L225 Difference]: With dead ends: 1270 [2021-08-25 20:25:31,891 INFO L226 Difference]: Without dead ends: 712 [2021-08-25 20:25:31,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-08-25 20:25:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 599. [2021-08-25 20:25:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4096989966555185) internal successors, (843), 598 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 843 transitions. [2021-08-25 20:25:31,904 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 843 transitions. Word has length 164 [2021-08-25 20:25:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:31,904 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 843 transitions. [2021-08-25 20:25:31,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 843 transitions. [2021-08-25 20:25:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:25:31,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:31,906 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:31,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:32,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:32,106 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 809471139, now seen corresponding path program 1 times [2021-08-25 20:25:32,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:32,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325807027] [2021-08-25 20:25:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:32,107 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:32,108 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:32,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-08-25 20:25:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:33,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:33,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:33,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:34,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:34,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:34,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:34,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325807027] [2021-08-25 20:25:34,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325807027] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:34,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:34,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:34,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274285577] [2021-08-25 20:25:34,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:34,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:34,767 INFO L87 Difference]: Start difference. First operand 599 states and 843 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:38,141 INFO L93 Difference]: Finished difference Result 1285 states and 1817 transitions. [2021-08-25 20:25:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2021-08-25 20:25:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:38,145 INFO L225 Difference]: With dead ends: 1285 [2021-08-25 20:25:38,145 INFO L226 Difference]: Without dead ends: 705 [2021-08-25 20:25:38,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-08-25 20:25:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 599. [2021-08-25 20:25:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.3896321070234114) internal successors, (831), 598 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 831 transitions. [2021-08-25 20:25:38,156 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 831 transitions. Word has length 165 [2021-08-25 20:25:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:38,156 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 831 transitions. [2021-08-25 20:25:38,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 831 transitions. [2021-08-25 20:25:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-08-25 20:25:38,157 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:38,157 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-08-25 20:25:38,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:38,369 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash 485310471, now seen corresponding path program 1 times [2021-08-25 20:25:38,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:38,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134413699] [2021-08-25 20:25:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:38,370 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:38,371 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:38,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-08-25 20:25:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:40,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:25:40,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:25:40,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:25:41,044 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:41,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134413699] [2021-08-25 20:25:41,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134413699] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:41,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:41,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:25:41,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176146644] [2021-08-25 20:25:41,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:25:41,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:25:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:25:41,046 INFO L87 Difference]: Start difference. First operand 599 states and 831 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:41,569 INFO L93 Difference]: Finished difference Result 2286 states and 3187 transitions. [2021-08-25 20:25:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:25:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2021-08-25 20:25:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:41,573 INFO L225 Difference]: With dead ends: 2286 [2021-08-25 20:25:41,574 INFO L226 Difference]: Without dead ends: 1706 [2021-08-25 20:25:41,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:25:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-08-25 20:25:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1683. [2021-08-25 20:25:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3864447086801426) internal successors, (2332), 1682 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2332 transitions. [2021-08-25 20:25:41,602 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2332 transitions. Word has length 167 [2021-08-25 20:25:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:41,602 INFO L470 AbstractCegarLoop]: Abstraction has 1683 states and 2332 transitions. [2021-08-25 20:25:41,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2332 transitions. [2021-08-25 20:25:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:25:41,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:41,604 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:41,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-08-25 20:25:41,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:41,817 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash -514909594, now seen corresponding path program 1 times [2021-08-25 20:25:41,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:41,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435641614] [2021-08-25 20:25:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:41,818 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:41,819 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-08-25 20:25:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:43,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:43,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:43,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:43,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:25:44,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:25:44,680 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:44,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435641614] [2021-08-25 20:25:44,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435641614] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:44,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:44,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:44,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790072345] [2021-08-25 20:25:44,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:44,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:44,681 INFO L87 Difference]: Start difference. First operand 1683 states and 2332 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:47,754 INFO L93 Difference]: Finished difference Result 3721 states and 5160 transitions. [2021-08-25 20:25:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:25:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2021-08-25 20:25:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:47,761 INFO L225 Difference]: With dead ends: 3721 [2021-08-25 20:25:47,761 INFO L226 Difference]: Without dead ends: 2057 [2021-08-25 20:25:47,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:25:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2021-08-25 20:25:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1755. [2021-08-25 20:25:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.3677309007981755) internal successors, (2399), 1754 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2399 transitions. [2021-08-25 20:25:47,817 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2399 transitions. Word has length 168 [2021-08-25 20:25:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:47,818 INFO L470 AbstractCegarLoop]: Abstraction has 1755 states and 2399 transitions. [2021-08-25 20:25:47,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2399 transitions. [2021-08-25 20:25:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:25:47,819 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:47,820 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:47,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:48,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:48,032 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1215349056, now seen corresponding path program 1 times [2021-08-25 20:25:48,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:48,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033053229] [2021-08-25 20:25:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:48,034 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:48,034 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-08-25 20:25:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:50,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:25:50,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:50,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:25:50,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:50,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033053229] [2021-08-25 20:25:50,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033053229] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:50,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:50,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:25:50,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327449573] [2021-08-25 20:25:50,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:25:50,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:50,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:25:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:25:50,850 INFO L87 Difference]: Start difference. First operand 1755 states and 2399 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:51,257 INFO L93 Difference]: Finished difference Result 4022 states and 5509 transitions. [2021-08-25 20:25:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:25:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2021-08-25 20:25:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:51,263 INFO L225 Difference]: With dead ends: 4022 [2021-08-25 20:25:51,263 INFO L226 Difference]: Without dead ends: 2286 [2021-08-25 20:25:51,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:25:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2021-08-25 20:25:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2265. [2021-08-25 20:25:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.3661660777385158) internal successors, (3093), 2264 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3093 transitions. [2021-08-25 20:25:51,309 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3093 transitions. Word has length 168 [2021-08-25 20:25:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:51,310 INFO L470 AbstractCegarLoop]: Abstraction has 2265 states and 3093 transitions. [2021-08-25 20:25:51,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3093 transitions. [2021-08-25 20:25:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-08-25 20:25:51,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:51,312 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:51,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:51,524 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1601211458, now seen corresponding path program 1 times [2021-08-25 20:25:51,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:51,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245892479] [2021-08-25 20:25:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:51,525 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:51,526 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-08-25 20:25:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:53,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:25:53,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:25:53,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:25:54,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:54,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245892479] [2021-08-25 20:25:54,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245892479] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:54,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:54,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:25:54,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524687978] [2021-08-25 20:25:54,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:25:54,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:25:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:25:54,190 INFO L87 Difference]: Start difference. First operand 2265 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:25:54,327 INFO L93 Difference]: Finished difference Result 5088 states and 6954 transitions. [2021-08-25 20:25:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:25:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2021-08-25 20:25:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:25:54,360 INFO L225 Difference]: With dead ends: 5088 [2021-08-25 20:25:54,360 INFO L226 Difference]: Without dead ends: 2842 [2021-08-25 20:25:54,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:25:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2021-08-25 20:25:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2821. [2021-08-25 20:25:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.3631205673758866) internal successors, (3844), 2820 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3844 transitions. [2021-08-25 20:25:54,458 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3844 transitions. Word has length 168 [2021-08-25 20:25:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:25:54,458 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 3844 transitions. [2021-08-25 20:25:54,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:25:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3844 transitions. [2021-08-25 20:25:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-08-25 20:25:54,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:25:54,461 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:25:54,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-08-25 20:25:54,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:25:54,673 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:25:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:25:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1153416203, now seen corresponding path program 1 times [2021-08-25 20:25:54,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:25:54,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86827114] [2021-08-25 20:25:54,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:25:54,675 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:25:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:25:54,675 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:25:54,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-08-25 20:25:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:25:57,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:25:57,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:25:57,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:25:57,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:25:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:25:57,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:25:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:25:57,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:25:57,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86827114] [2021-08-25 20:25:57,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86827114] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:25:57,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:25:57,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:25:57,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950240744] [2021-08-25 20:25:57,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:25:57,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:25:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:25:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:25:57,829 INFO L87 Difference]: Start difference. First operand 2821 states and 3844 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:26:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:26:01,473 INFO L93 Difference]: Finished difference Result 4934 states and 6732 transitions. [2021-08-25 20:26:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:26:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-08-25 20:26:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:26:01,482 INFO L225 Difference]: With dead ends: 4934 [2021-08-25 20:26:01,482 INFO L226 Difference]: Without dead ends: 2097 [2021-08-25 20:26:01,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:26:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2021-08-25 20:26:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1812. [2021-08-25 20:26:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 1.3473219215902816) internal successors, (2440), 1811 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:26:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2440 transitions. [2021-08-25 20:26:01,541 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2440 transitions. Word has length 169 [2021-08-25 20:26:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:26:01,541 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 2440 transitions. [2021-08-25 20:26:01,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:26:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2440 transitions. [2021-08-25 20:26:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:26:01,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:26:01,543 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:26:01,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-08-25 20:26:01,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:26:01,744 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:26:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:26:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash 165451016, now seen corresponding path program 1 times [2021-08-25 20:26:01,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:26:01,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820412854] [2021-08-25 20:26:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:26:01,745 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:26:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:26:01,745 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:26:01,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-08-25 20:26:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:26:04,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-25 20:26:04,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:26:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 86 [2021-08-25 20:26:04,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:04,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 57 [2021-08-25 20:26:04,090 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-25 20:26:04,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2021-08-25 20:26:04,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,194 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:04,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2021-08-25 20:26:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,575 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:04,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2021-08-25 20:26:04,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:04,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:04,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 47 [2021-08-25 20:26:05,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:05,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2021-08-25 20:26:05,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:05,130 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:05,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2021-08-25 20:26:06,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:26:06,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:26:06,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,141 INFO L354 Elim1Store]: treesize reduction 396, result has 10.2 percent of original size [2021-08-25 20:26:06,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 82 [2021-08-25 20:26:06,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:26:06,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2021-08-25 20:26:06,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,447 INFO L354 Elim1Store]: treesize reduction 184, result has 9.4 percent of original size [2021-08-25 20:26:06,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 110 treesize of output 86 [2021-08-25 20:26:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:06,505 INFO L354 Elim1Store]: treesize reduction 184, result has 9.4 percent of original size [2021-08-25 20:26:06,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 91 treesize of output 67 [2021-08-25 20:26:07,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:26:07,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:07,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:07,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:07,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:07,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:07,943 INFO L354 Elim1Store]: treesize reduction 184, result has 9.4 percent of original size [2021-08-25 20:26:07,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 67 [2021-08-25 20:26:08,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:08,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:26:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:08,053 INFO L354 Elim1Store]: treesize reduction 137, result has 2.1 percent of original size [2021-08-25 20:26:08,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 57 [2021-08-25 20:26:08,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2021-08-25 20:26:08,072 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-25 20:26:08,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-08-25 20:26:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:26:08,155 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-08-25 20:26:08,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2021-08-25 20:26:08,797 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:26:08,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 17 [2021-08-25 20:26:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:26:08,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:26:09,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2021-08-25 20:26:11,343 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:26:11,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2021-08-25 20:27:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 39 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:27:15,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:27:15,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820412854] [2021-08-25 20:27:15,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820412854] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:27:15,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:27:15,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2021-08-25 20:27:15,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2257286] [2021-08-25 20:27:15,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-25 20:27:15,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:27:15,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-25 20:27:15,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=170, Unknown=28, NotChecked=0, Total=272 [2021-08-25 20:27:15,519 INFO L87 Difference]: Start difference. First operand 1812 states and 2440 transitions. Second operand has 17 states, 17 states have (on average 17.941176470588236) internal successors, (305), 17 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:58,691 INFO L93 Difference]: Finished difference Result 5827 states and 7834 transitions. [2021-08-25 20:31:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 20:31:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.941176470588236) internal successors, (305), 17 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2021-08-25 20:31:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:58,698 INFO L225 Difference]: With dead ends: 5827 [2021-08-25 20:31:58,698 INFO L226 Difference]: Without dead ends: 4058 [2021-08-25 20:31:58,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 97101.4ms TimeCoverageRelationStatistics Valid=156, Invalid=308, Unknown=42, NotChecked=0, Total=506 [2021-08-25 20:31:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2021-08-25 20:31:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3277. [2021-08-25 20:31:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3276 states have (on average 1.3547008547008548) internal successors, (4438), 3276 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4438 transitions. [2021-08-25 20:31:58,773 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4438 transitions. Word has length 173 [2021-08-25 20:31:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:58,774 INFO L470 AbstractCegarLoop]: Abstraction has 3277 states and 4438 transitions. [2021-08-25 20:31:58,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.941176470588236) internal successors, (305), 17 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4438 transitions. [2021-08-25 20:31:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-08-25 20:31:58,775 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:58,776 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:58,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-08-25 20:31:58,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:31:58,995 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1106098171, now seen corresponding path program 1 times [2021-08-25 20:31:58,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:58,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401154566] [2021-08-25 20:31:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:58,996 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:58,997 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:31:58,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-08-25 20:32:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:01,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-25 20:32:01,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:01,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2021-08-25 20:32:01,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-08-25 20:32:01,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-08-25 20:32:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:01,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:01,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:32:02,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:02,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:02,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:02,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:02,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:02,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:02,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:32:02,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:32:02,470 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:32:02,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 97 [2021-08-25 20:32:02,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2021-08-25 20:32:02,490 INFO L354 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2021-08-25 20:32:02,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 65 [2021-08-25 20:32:02,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-08-25 20:32:02,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2021-08-25 20:32:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2021-08-25 20:32:02,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:03,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 140 [2021-08-25 20:32:03,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 98 [2021-08-25 20:32:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2021-08-25 20:32:03,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:03,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401154566] [2021-08-25 20:32:03,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401154566] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:03,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:03,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-25 20:32:03,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146956151] [2021-08-25 20:32:03,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 20:32:03,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:03,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 20:32:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:03,512 INFO L87 Difference]: Start difference. First operand 3277 states and 4438 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:13,415 INFO L93 Difference]: Finished difference Result 7950 states and 10784 transitions. [2021-08-25 20:32:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:32:13,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2021-08-25 20:32:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:13,423 INFO L225 Difference]: With dead ends: 7950 [2021-08-25 20:32:13,424 INFO L226 Difference]: Without dead ends: 4716 [2021-08-25 20:32:13,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 372 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:32:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2021-08-25 20:32:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4583. [2021-08-25 20:32:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 1.3651243998254037) internal successors, (6255), 4582 states have internal predecessors, (6255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6255 transitions. [2021-08-25 20:32:13,526 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6255 transitions. Word has length 193 [2021-08-25 20:32:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:13,526 INFO L470 AbstractCegarLoop]: Abstraction has 4583 states and 6255 transitions. [2021-08-25 20:32:13,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6255 transitions. [2021-08-25 20:32:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-08-25 20:32:13,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:13,529 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:13,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:13,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:13,742 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash 482816569, now seen corresponding path program 1 times [2021-08-25 20:32:13,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:13,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617189904] [2021-08-25 20:32:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:13,743 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:13,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:13,744 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:13,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-08-25 20:32:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:17,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-25 20:32:17,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:17,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2021-08-25 20:32:17,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-08-25 20:32:17,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-08-25 20:32:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:17,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:17,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:32:17,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:17,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:32:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:32:17,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:32:17,739 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:32:17,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:32:17,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:17,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:32:17,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:32:18,021 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:32:18,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:32:18,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,512 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:32:18,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:32:18,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:32:18,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:32:18,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:32:18,615 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:32:18,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:32:18,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:32:18,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:32:18,654 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:32:18,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:32:18,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:32:18,684 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:32:18,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:32:18,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:18,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:32:18,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-08-25 20:32:19,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2021-08-25 20:32:19,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2021-08-25 20:32:19,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:32:19,427 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-25 20:32:19,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:32:20,195 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:32:20,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2021-08-25 20:32:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:32:20,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:20,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 416 [2021-08-25 20:32:20,598 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:32:20,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 383 [2021-08-25 20:32:20,838 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-25 20:32:20,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 542 treesize of output 523 [2021-08-25 20:32:26,098 WARN L207 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2021-08-25 20:32:26,098 INFO L354 Elim1Store]: treesize reduction 233, result has 28.3 percent of original size [2021-08-25 20:32:26,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 587 treesize of output 538 [2021-08-25 20:32:26,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:26,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617189904] [2021-08-25 20:32:26,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-08-25 20:32:26,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [704868253] [2021-08-25 20:32:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:26,123 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-25 20:32:26,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-25 20:32:26,137 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-25 20:32:26,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-08-25 20:32:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:32,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-25 20:32:32,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3dbed90e [2021-08-25 20:32:32,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39033622] [2021-08-25 20:32:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:32,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:32:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:32:32,890 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:32:32,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-25 20:32:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:36,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-25 20:32:36,364 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3dbed90e [2021-08-25 20:32:36,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:36,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-25 20:32:36,364 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-25 20:32:36,364 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-25 20:32:36,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:32:36,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:36,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:36,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-08-25 20:32:36,974 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:32:37,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:32:37 BoogieIcfgContainer [2021-08-25 20:32:37,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:32:37,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:32:37,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:32:37,023 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:32:37,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:23:26" (3/4) ... [2021-08-25 20:32:37,028 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:32:37,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:32:37,029 INFO L168 Benchmark]: Toolchain (without parser) took 552363.98 ms. Allocated memory was 60.8 MB in the beginning and 989.9 MB in the end (delta: 929.0 MB). Free memory was 36.8 MB in the beginning and 622.9 MB in the end (delta: -586.2 MB). Peak memory consumption was 345.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,029 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.6 MB in the beginning and 42.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:32:37,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.65 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 36.6 MB in the beginning and 50.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.12 ms. Allocated memory is still 88.1 MB. Free memory was 50.3 MB in the beginning and 66.2 MB in the end (delta: -15.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,034 INFO L168 Benchmark]: Boogie Preprocessor took 91.02 ms. Allocated memory is still 88.1 MB. Free memory was 66.2 MB in the beginning and 59.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,036 INFO L168 Benchmark]: RCFGBuilder took 1386.97 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 59.1 MB in the beginning and 78.6 MB in the end (delta: -19.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,036 INFO L168 Benchmark]: TraceAbstraction took 550178.36 ms. Allocated memory was 130.0 MB in the beginning and 989.9 MB in the end (delta: 859.8 MB). Free memory was 77.9 MB in the beginning and 622.9 MB in the end (delta: -545.0 MB). Peak memory consumption was 315.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:32:37,037 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 989.9 MB. Free memory is still 622.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:32:37,044 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.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.6 MB in the beginning and 42.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 603.65 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 36.6 MB in the beginning and 50.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.12 ms. Allocated memory is still 88.1 MB. Free memory was 50.3 MB in the beginning and 66.2 MB in the end (delta: -15.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.02 ms. Allocated memory is still 88.1 MB. Free memory was 66.2 MB in the beginning and 59.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1386.97 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 59.1 MB in the beginning and 78.6 MB in the end (delta: -19.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 550178.36 ms. Allocated memory was 130.0 MB in the beginning and 989.9 MB in the end (delta: 859.8 MB). Free memory was 77.9 MB in the beginning and 622.9 MB in the end (delta: -545.0 MB). Peak memory consumption was 315.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.21 ms. Allocated memory is still 989.9 MB. Free memory is still 622.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1776]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) [L1132] EXPR s->cert [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 [L1349] COND FALSE !(ret <= 0) [L1354] s->hit [L1354] COND FALSE !(s->hit) [L1357] s->state = 8512 [L1359] s->init_num = 0 [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1363] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1364] skip = 1 [L1378] s->state = 8528 [L1379] s->init_num = 0 [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND TRUE s->state == 8528 [L1383] EXPR s->s3 [L1383] EXPR (s->s3)->tmp.new_cipher [L1383] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1383] l = ((s->s3)->tmp.new_cipher)->algorithms [L1384] EXPR s->options [L1384] COND FALSE !(s->options & 2097152UL) [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp = 0 [L1389] EXPR s->s3 [L1389] (s->s3)->tmp.use_rsa_tmp [L1389] COND FALSE !((s->s3)->tmp.use_rsa_tmp) [L1392] COND FALSE !(l & 30UL) [L1395] COND FALSE !(l & 1UL) [L1426] skip = 1 [L1430] s->state = 8544 [L1431] s->init_num = 0 [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND TRUE s->state == 8544 [L1435] EXPR s->verify_mode [L1435] COND TRUE s->verify_mode & 1 [L1436] EXPR s->session [L1436] EXPR (s->session)->peer [L1436] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1446] EXPR s->s3 [L1446] EXPR (s->s3)->tmp.new_cipher [L1446] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1446] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1456] EXPR s->s3 [L1456] (s->s3)->tmp.cert_request = 1 [L1457] ret = __VERIFIER_nondet_int() [L1458] COND FALSE !(blastFlag == 4) [L1463] COND FALSE !(ret <= 0) [L1468] s->state = 8448 [L1469] EXPR s->s3 [L1469] (s->s3)->tmp.next_state = 8576 [L1470] s->init_num = 0 [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state [L1225] COND TRUE s->state == 8640 [L1572] ret = __VERIFIER_nondet_int() [L1573] COND FALSE !(blastFlag == 9) [L1576] COND FALSE !(blastFlag == 12) [L1579] COND FALSE !(blastFlag == 15) [L1582] COND FALSE !(blastFlag == 18) [L1776] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 550088.6ms, OverallIterations: 38, TraceHistogramMax: 7, EmptinessCheckTime: 50.1ms, AutomataDifference: 380339.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6667 SDtfs, 8398 SDslu, 17486 SDs, 0 SdLazy, 14854 SolverSat, 2586 SolverUnsat, 125 SolverUnknown, 0 SolverNotchecked, 337132.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8936 GetRequests, 8702 SyntacticMatches, 16 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 98468.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4583occurred in iteration=37, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 778.0ms AutomataMinimizationTime, 37 MinimizatonAttempts, 5512 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1282.5ms SsaConstructionTime, 3679.0ms SatisfiabilityAnalysisTime, 97139.8ms InterpolantComputationTime, 4470 NumberOfCodeBlocks, 4470 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8866 ConstructedInterpolants, 209 QuantifiedInterpolants, 41132 SizeOfPredicates, 125 NumberOfNonLiveVariables, 11055 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 74 InterpolantComputations, 72 PerfectInterpolantSequences, 8591/8858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:32:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...