./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD --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 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:54:36,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:54:36,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:54:36,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:54:36,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:54:36,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:54:36,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:54:36,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:54:36,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:54:36,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:54:36,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:54:36,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:54:36,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:54:36,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:54:36,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:54:36,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:54:36,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:54:36,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:54:36,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:54:36,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:54:36,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:54:36,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:54:36,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:54:36,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:54:36,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:54:36,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:54:36,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:54:36,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:54:36,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:54:36,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:54:36,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:54:36,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:54:36,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:54:36,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:54:36,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:54:36,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:54:36,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:54:36,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:54:36,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:54:36,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:54:36,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:54:36,294 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:54:36,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:54:36,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:54:36,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:54:36,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:54:36,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:54:36,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:54:36,369 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:54:36,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:54:36,369 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:54:36,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:54:36,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:54:36,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:54:36,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:54:36,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:54:36,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:54:36,373 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:54:36,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:54:36,373 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:54:36,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:54:36,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:54:36,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:54:36,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:54:36,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:54:36,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:54:36,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:54:36,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:54:36,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:54:36,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:54:36,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:54:36,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:54:36,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:54:36,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:54:36,380 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD 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 -> 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 [2021-10-28 22:54:36,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:54:36,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:54:36,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:54:36,774 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:54:36,775 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:54:36,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-10-28 22:54:36,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/data/9832c58ec/d2ba2d1fd37245289f4028946bd163a2/FLAGed02598cb [2021-10-28 22:54:37,756 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:54:37,757 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-10-28 22:54:37,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/data/9832c58ec/d2ba2d1fd37245289f4028946bd163a2/FLAGed02598cb [2021-10-28 22:54:37,945 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/data/9832c58ec/d2ba2d1fd37245289f4028946bd163a2 [2021-10-28 22:54:37,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:54:37,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:54:37,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:54:37,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:54:37,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:54:37,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:54:37" (1/1) ... [2021-10-28 22:54:37,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bdf67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:37, skipping insertion in model container [2021-10-28 22:54:37,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:54:37" (1/1) ... [2021-10-28 22:54:37,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:54:38,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:54:38,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-10-28 22:54:38,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:54:38,585 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:54:38,703 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-10-28 22:54:38,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:54:38,727 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:54:38,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38 WrapperNode [2021-10-28 22:54:38,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:54:38,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:54:38,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:54:38,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:54:38,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:54:38,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:54:38,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:54:38,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:54:38,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:38,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:39,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:39,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:39,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:54:39,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:54:39,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:54:39,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:54:39,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (1/1) ... [2021-10-28 22:54:39,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:54:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:54:39,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:54:39,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:54:39,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:54:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:54:39,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:54:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:54:39,525 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,578 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,583 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,596 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,598 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,604 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,613 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,617 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,620 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,621 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,623 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,626 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,629 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,631 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,631 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,635 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,638 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,642 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,644 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,648 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,652 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,654 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,657 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,659 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,661 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,662 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:39,663 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 22:54:41,307 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-28 22:54:41,308 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-28 22:54:41,308 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-28 22:54:41,308 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-28 22:54:41,309 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-28 22:54:41,309 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-28 22:54:41,309 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-28 22:54:41,309 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-28 22:54:41,310 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-28 22:54:41,310 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-28 22:54:41,310 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-28 22:54:41,310 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-28 22:54:41,310 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-28 22:54:41,311 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-28 22:54:41,311 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-28 22:54:41,311 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-28 22:54:41,311 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-28 22:54:41,312 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-28 22:54:41,312 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-28 22:54:41,312 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-28 22:54:41,312 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-28 22:54:41,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-28 22:54:41,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-28 22:54:41,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-28 22:54:41,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-28 22:54:41,314 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-28 22:54:41,314 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-28 22:54:41,314 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-28 22:54:41,314 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-28 22:54:41,315 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-28 22:54:41,315 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-28 22:54:41,315 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-28 22:54:41,315 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-28 22:54:41,315 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-28 22:54:41,316 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-28 22:54:41,316 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-28 22:54:41,316 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-28 22:54:41,316 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-28 22:54:41,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-28 22:54:41,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-28 22:54:41,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-28 22:54:41,317 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-28 22:54:41,318 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-28 22:54:41,318 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-28 22:54:41,318 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-28 22:54:41,318 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-28 22:54:41,319 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-28 22:54:41,319 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-28 22:54:41,319 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-28 22:54:41,319 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-28 22:54:41,319 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-28 22:54:41,320 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-28 22:54:41,320 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-28 22:54:41,320 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-28 22:54:41,320 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-28 22:54:41,321 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-28 22:54:41,321 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-28 22:54:41,321 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-28 22:54:41,321 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-28 22:54:41,321 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-28 22:54:41,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:54:41,339 INFO L299 CfgBuilder]: Removed 277 assume(true) statements. [2021-10-28 22:54:41,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:41 BoogieIcfgContainer [2021-10-28 22:54:41,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:54:41,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:54:41,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:54:41,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:54:41,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:54:37" (1/3) ... [2021-10-28 22:54:41,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1814bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:54:41, skipping insertion in model container [2021-10-28 22:54:41,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:38" (2/3) ... [2021-10-28 22:54:41,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1814bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:54:41, skipping insertion in model container [2021-10-28 22:54:41,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:41" (3/3) ... [2021-10-28 22:54:41,355 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2021-10-28 22:54:41,362 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:54:41,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-10-28 22:54:41,431 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:54:41,439 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, mAutomataTypeConcurrency=PETRI_NET, 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-10-28 22:54:41,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-10-28 22:54:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 572 states, 517 states have (on average 1.6034816247582204) internal successors, (829), 571 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 22:54:41,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:41,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:41,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2021-10-28 22:54:41,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:41,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143470787] [2021-10-28 22:54:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:41,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:41,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:41,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143470787] [2021-10-28 22:54:41,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143470787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:41,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:41,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:41,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698568680] [2021-10-28 22:54:41,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:41,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:41,901 INFO L87 Difference]: Start difference. First operand has 572 states, 517 states have (on average 1.6034816247582204) internal successors, (829), 571 states have internal predecessors, (829), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:42,427 INFO L93 Difference]: Finished difference Result 1136 states and 1626 transitions. [2021-10-28 22:54:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-28 22:54:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:42,477 INFO L225 Difference]: With dead ends: 1136 [2021-10-28 22:54:42,477 INFO L226 Difference]: Without dead ends: 692 [2021-10-28 22:54:42,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-10-28 22:54:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2021-10-28 22:54:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 631 states have (on average 1.434231378763867) internal successors, (905), 665 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2021-10-28 22:54:42,613 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 10 [2021-10-28 22:54:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:42,614 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2021-10-28 22:54:42,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2021-10-28 22:54:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-28 22:54:42,616 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:42,616 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:42,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:54:42,617 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2021-10-28 22:54:42,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:42,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284337545] [2021-10-28 22:54:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:42,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:42,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:42,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284337545] [2021-10-28 22:54:42,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284337545] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:42,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:42,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:42,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264863] [2021-10-28 22:54:42,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:42,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:42,710 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:42,768 INFO L93 Difference]: Finished difference Result 688 states and 930 transitions. [2021-10-28 22:54:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-28 22:54:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:42,778 INFO L225 Difference]: With dead ends: 688 [2021-10-28 22:54:42,778 INFO L226 Difference]: Without dead ends: 666 [2021-10-28 22:54:42,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-28 22:54:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-10-28 22:54:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 631 states have (on average 1.432646592709984) internal successors, (904), 665 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2021-10-28 22:54:42,854 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 11 [2021-10-28 22:54:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:42,855 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2021-10-28 22:54:42,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2021-10-28 22:54:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 22:54:42,857 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:42,857 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:42,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:54:42,858 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2021-10-28 22:54:42,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:42,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312386557] [2021-10-28 22:54:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:42,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:43,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:43,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312386557] [2021-10-28 22:54:43,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312386557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:43,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:43,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:43,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22029450] [2021-10-28 22:54:43,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:43,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,030 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:43,120 INFO L93 Difference]: Finished difference Result 762 states and 1022 transitions. [2021-10-28 22:54:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-28 22:54:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:43,127 INFO L225 Difference]: With dead ends: 762 [2021-10-28 22:54:43,128 INFO L226 Difference]: Without dead ends: 735 [2021-10-28 22:54:43,130 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-10-28 22:54:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 686. [2021-10-28 22:54:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 654 states have (on average 1.4388379204892967) internal successors, (941), 685 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 941 transitions. [2021-10-28 22:54:43,194 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 941 transitions. Word has length 16 [2021-10-28 22:54:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:43,195 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 941 transitions. [2021-10-28 22:54:43,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 941 transitions. [2021-10-28 22:54:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 22:54:43,200 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:43,200 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:43,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:54:43,201 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2021-10-28 22:54:43,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:43,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024305582] [2021-10-28 22:54:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:43,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:43,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:43,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024305582] [2021-10-28 22:54:43,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024305582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:43,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:43,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:43,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310280770] [2021-10-28 22:54:43,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:43,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:43,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,311 INFO L87 Difference]: Start difference. First operand 686 states and 941 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:43,666 INFO L93 Difference]: Finished difference Result 723 states and 987 transitions. [2021-10-28 22:54:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-28 22:54:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:43,673 INFO L225 Difference]: With dead ends: 723 [2021-10-28 22:54:43,673 INFO L226 Difference]: Without dead ends: 718 [2021-10-28 22:54:43,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-10-28 22:54:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2021-10-28 22:54:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 683 states have (on average 1.4333821376281113) internal successors, (979), 714 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 979 transitions. [2021-10-28 22:54:43,720 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 979 transitions. Word has length 19 [2021-10-28 22:54:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:43,721 INFO L470 AbstractCegarLoop]: Abstraction has 715 states and 979 transitions. [2021-10-28 22:54:43,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 979 transitions. [2021-10-28 22:54:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 22:54:43,730 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:43,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:43,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:54:43,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2021-10-28 22:54:43,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:43,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285256319] [2021-10-28 22:54:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:43,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:43,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:43,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285256319] [2021-10-28 22:54:43,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285256319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:43,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:43,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:43,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396020646] [2021-10-28 22:54:43,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:43,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,864 INFO L87 Difference]: Start difference. First operand 715 states and 979 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:43,962 INFO L93 Difference]: Finished difference Result 1230 states and 1671 transitions. [2021-10-28 22:54:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-28 22:54:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:43,971 INFO L225 Difference]: With dead ends: 1230 [2021-10-28 22:54:43,971 INFO L226 Difference]: Without dead ends: 858 [2021-10-28 22:54:43,976 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2021-10-28 22:54:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 697. [2021-10-28 22:54:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.4148148148148147) internal successors, (955), 696 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2021-10-28 22:54:44,027 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 19 [2021-10-28 22:54:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:44,028 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2021-10-28 22:54:44,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2021-10-28 22:54:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 22:54:44,031 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:44,031 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:44,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:54:44,033 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -946806949, now seen corresponding path program 1 times [2021-10-28 22:54:44,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:44,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636587421] [2021-10-28 22:54:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:44,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:44,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:44,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636587421] [2021-10-28 22:54:44,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636587421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:44,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:44,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:44,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140006366] [2021-10-28 22:54:44,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:44,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:44,167 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:44,498 INFO L93 Difference]: Finished difference Result 709 states and 965 transitions. [2021-10-28 22:54:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-28 22:54:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:44,505 INFO L225 Difference]: With dead ends: 709 [2021-10-28 22:54:44,506 INFO L226 Difference]: Without dead ends: 700 [2021-10-28 22:54:44,506 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-10-28 22:54:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 697. [2021-10-28 22:54:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.411851851851852) internal successors, (953), 696 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 953 transitions. [2021-10-28 22:54:44,567 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 953 transitions. Word has length 20 [2021-10-28 22:54:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:44,568 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 953 transitions. [2021-10-28 22:54:44,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 953 transitions. [2021-10-28 22:54:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 22:54:44,570 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:44,570 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:44,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:54:44,571 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 180793810, now seen corresponding path program 1 times [2021-10-28 22:54:44,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:44,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698061870] [2021-10-28 22:54:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:44,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:44,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:44,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698061870] [2021-10-28 22:54:44,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698061870] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:44,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:44,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:44,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478773565] [2021-10-28 22:54:44,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:44,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:44,699 INFO L87 Difference]: Start difference. First operand 697 states and 953 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:44,989 INFO L93 Difference]: Finished difference Result 709 states and 963 transitions. [2021-10-28 22:54:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-28 22:54:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:44,998 INFO L225 Difference]: With dead ends: 709 [2021-10-28 22:54:44,998 INFO L226 Difference]: Without dead ends: 700 [2021-10-28 22:54:44,999 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-10-28 22:54:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 697. [2021-10-28 22:54:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.4088888888888889) internal successors, (951), 696 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2021-10-28 22:54:45,073 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 21 [2021-10-28 22:54:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:45,073 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2021-10-28 22:54:45,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2021-10-28 22:54:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 22:54:45,075 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:45,075 INFO L513 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] [2021-10-28 22:54:45,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:54:45,077 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 945683314, now seen corresponding path program 1 times [2021-10-28 22:54:45,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:45,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406978810] [2021-10-28 22:54:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:45,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:45,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:45,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406978810] [2021-10-28 22:54:45,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406978810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:45,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:45,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:45,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629694890] [2021-10-28 22:54:45,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:45,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:45,140 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:45,222 INFO L93 Difference]: Finished difference Result 709 states and 962 transitions. [2021-10-28 22:54:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-28 22:54:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:45,229 INFO L225 Difference]: With dead ends: 709 [2021-10-28 22:54:45,229 INFO L226 Difference]: Without dead ends: 689 [2021-10-28 22:54:45,230 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-10-28 22:54:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2021-10-28 22:54:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 667 states have (on average 1.4107946026986506) internal successors, (941), 688 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 941 transitions. [2021-10-28 22:54:45,289 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 941 transitions. Word has length 22 [2021-10-28 22:54:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:45,290 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 941 transitions. [2021-10-28 22:54:45,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 941 transitions. [2021-10-28 22:54:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 22:54:45,292 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:45,292 INFO L513 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] [2021-10-28 22:54:45,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:54:45,293 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2021-10-28 22:54:45,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:45,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339312223] [2021-10-28 22:54:45,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:45,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:45,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:45,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339312223] [2021-10-28 22:54:45,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339312223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:45,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:45,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:45,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812714698] [2021-10-28 22:54:45,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:45,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:45,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:45,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:45,343 INFO L87 Difference]: Start difference. First operand 689 states and 941 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:45,576 INFO L93 Difference]: Finished difference Result 689 states and 941 transitions. [2021-10-28 22:54:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-28 22:54:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:45,584 INFO L225 Difference]: With dead ends: 689 [2021-10-28 22:54:45,584 INFO L226 Difference]: Without dead ends: 673 [2021-10-28 22:54:45,585 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-28 22:54:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2021-10-28 22:54:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 659 states have (on average 1.402124430955994) internal successors, (924), 672 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 924 transitions. [2021-10-28 22:54:45,673 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 924 transitions. Word has length 23 [2021-10-28 22:54:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:45,674 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 924 transitions. [2021-10-28 22:54:45,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 924 transitions. [2021-10-28 22:54:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 22:54:45,675 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:45,676 INFO L513 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] [2021-10-28 22:54:45,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:54:45,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:45,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2021-10-28 22:54:45,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:45,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092036926] [2021-10-28 22:54:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:45,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:45,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:45,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092036926] [2021-10-28 22:54:45,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092036926] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:45,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:45,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:45,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551008693] [2021-10-28 22:54:45,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:45,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:45,736 INFO L87 Difference]: Start difference. First operand 673 states and 924 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:45,829 INFO L93 Difference]: Finished difference Result 806 states and 1074 transitions. [2021-10-28 22:54:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:54:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-10-28 22:54:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:45,835 INFO L225 Difference]: With dead ends: 806 [2021-10-28 22:54:45,836 INFO L226 Difference]: Without dead ends: 755 [2021-10-28 22:54:45,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-10-28 22:54:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 675. [2021-10-28 22:54:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 661 states have (on average 1.4009077155824508) internal successors, (926), 674 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 926 transitions. [2021-10-28 22:54:45,894 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 926 transitions. Word has length 25 [2021-10-28 22:54:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:45,894 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 926 transitions. [2021-10-28 22:54:45,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 926 transitions. [2021-10-28 22:54:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-28 22:54:45,896 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:45,896 INFO L513 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] [2021-10-28 22:54:45,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:54:45,897 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 458344375, now seen corresponding path program 1 times [2021-10-28 22:54:45,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:45,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264134402] [2021-10-28 22:54:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:45,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:45,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:45,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264134402] [2021-10-28 22:54:45,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264134402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:45,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:45,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:45,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515054039] [2021-10-28 22:54:45,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:45,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:45,950 INFO L87 Difference]: Start difference. First operand 675 states and 926 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:46,029 INFO L93 Difference]: Finished difference Result 688 states and 938 transitions. [2021-10-28 22:54:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:46,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-28 22:54:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:46,036 INFO L225 Difference]: With dead ends: 688 [2021-10-28 22:54:46,036 INFO L226 Difference]: Without dead ends: 673 [2021-10-28 22:54:46,037 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-28 22:54:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2021-10-28 22:54:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 659 states have (on average 1.4006069802731411) internal successors, (923), 672 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 923 transitions. [2021-10-28 22:54:46,090 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 923 transitions. Word has length 26 [2021-10-28 22:54:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:46,090 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 923 transitions. [2021-10-28 22:54:46,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 923 transitions. [2021-10-28 22:54:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 22:54:46,092 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:46,093 INFO L513 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] [2021-10-28 22:54:46,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:54:46,093 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2021-10-28 22:54:46,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:46,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028759030] [2021-10-28 22:54:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:46,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:46,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:46,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028759030] [2021-10-28 22:54:46,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028759030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:46,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:46,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:46,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729616066] [2021-10-28 22:54:46,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:46,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:46,144 INFO L87 Difference]: Start difference. First operand 673 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:46,268 INFO L93 Difference]: Finished difference Result 711 states and 962 transitions. [2021-10-28 22:54:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-28 22:54:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:46,277 INFO L225 Difference]: With dead ends: 711 [2021-10-28 22:54:46,277 INFO L226 Difference]: Without dead ends: 690 [2021-10-28 22:54:46,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-28 22:54:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 675. [2021-10-28 22:54:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 661 states have (on average 1.399394856278366) internal successors, (925), 674 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 925 transitions. [2021-10-28 22:54:46,345 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 925 transitions. Word has length 27 [2021-10-28 22:54:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:46,345 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 925 transitions. [2021-10-28 22:54:46,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 925 transitions. [2021-10-28 22:54:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 22:54:46,349 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:46,349 INFO L513 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] [2021-10-28 22:54:46,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:54:46,350 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2021-10-28 22:54:46,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:46,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657326364] [2021-10-28 22:54:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:46,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:46,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:46,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657326364] [2021-10-28 22:54:46,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657326364] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:46,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:46,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:46,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957815721] [2021-10-28 22:54:46,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:46,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:46,437 INFO L87 Difference]: Start difference. First operand 675 states and 925 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:46,511 INFO L93 Difference]: Finished difference Result 708 states and 960 transitions. [2021-10-28 22:54:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-28 22:54:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:46,517 INFO L225 Difference]: With dead ends: 708 [2021-10-28 22:54:46,517 INFO L226 Difference]: Without dead ends: 666 [2021-10-28 22:54:46,518 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-28 22:54:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 661. [2021-10-28 22:54:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 647 states have (on average 1.39258114374034) internal successors, (901), 660 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 901 transitions. [2021-10-28 22:54:46,571 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 901 transitions. Word has length 27 [2021-10-28 22:54:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:46,571 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 901 transitions. [2021-10-28 22:54:46,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 901 transitions. [2021-10-28 22:54:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-28 22:54:46,573 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:46,573 INFO L513 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] [2021-10-28 22:54:46,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:54:46,574 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2021-10-28 22:54:46,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:46,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571523280] [2021-10-28 22:54:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:46,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:46,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:46,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571523280] [2021-10-28 22:54:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571523280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:46,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:46,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:46,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659430009] [2021-10-28 22:54:46,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:46,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:46,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:46,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:46,651 INFO L87 Difference]: Start difference. First operand 661 states and 901 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:46,751 INFO L93 Difference]: Finished difference Result 699 states and 940 transitions. [2021-10-28 22:54:46,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-28 22:54:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:46,757 INFO L225 Difference]: With dead ends: 699 [2021-10-28 22:54:46,758 INFO L226 Difference]: Without dead ends: 678 [2021-10-28 22:54:46,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-10-28 22:54:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 661. [2021-10-28 22:54:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 647 states have (on average 1.39258114374034) internal successors, (901), 660 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 901 transitions. [2021-10-28 22:54:46,812 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 901 transitions. Word has length 28 [2021-10-28 22:54:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:46,813 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 901 transitions. [2021-10-28 22:54:46,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 901 transitions. [2021-10-28 22:54:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-28 22:54:46,814 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:46,815 INFO L513 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] [2021-10-28 22:54:46,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:54:46,815 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash 830792837, now seen corresponding path program 1 times [2021-10-28 22:54:46,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:46,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851442196] [2021-10-28 22:54:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:46,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:46,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:46,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851442196] [2021-10-28 22:54:46,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851442196] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:46,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:46,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:46,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481772808] [2021-10-28 22:54:46,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:46,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:46,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:46,866 INFO L87 Difference]: Start difference. First operand 661 states and 901 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:47,163 INFO L93 Difference]: Finished difference Result 840 states and 1143 transitions. [2021-10-28 22:54:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-28 22:54:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:47,172 INFO L225 Difference]: With dead ends: 840 [2021-10-28 22:54:47,172 INFO L226 Difference]: Without dead ends: 832 [2021-10-28 22:54:47,174 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-10-28 22:54:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 679. [2021-10-28 22:54:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 665 states have (on average 1.3954887218045113) internal successors, (928), 678 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 928 transitions. [2021-10-28 22:54:47,232 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 928 transitions. Word has length 28 [2021-10-28 22:54:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:47,233 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 928 transitions. [2021-10-28 22:54:47,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 928 transitions. [2021-10-28 22:54:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-28 22:54:47,235 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:47,236 INFO L513 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] [2021-10-28 22:54:47,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:54:47,236 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1706944907, now seen corresponding path program 1 times [2021-10-28 22:54:47,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:47,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176253685] [2021-10-28 22:54:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:47,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:47,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:47,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176253685] [2021-10-28 22:54:47,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176253685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:47,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:47,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:47,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633175969] [2021-10-28 22:54:47,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:47,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:47,315 INFO L87 Difference]: Start difference. First operand 679 states and 928 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:47,403 INFO L93 Difference]: Finished difference Result 692 states and 940 transitions. [2021-10-28 22:54:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-28 22:54:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:47,409 INFO L225 Difference]: With dead ends: 692 [2021-10-28 22:54:47,410 INFO L226 Difference]: Without dead ends: 677 [2021-10-28 22:54:47,410 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-10-28 22:54:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2021-10-28 22:54:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 663 states have (on average 1.3951734539969833) internal successors, (925), 676 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 925 transitions. [2021-10-28 22:54:47,464 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 925 transitions. Word has length 28 [2021-10-28 22:54:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:47,465 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 925 transitions. [2021-10-28 22:54:47,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 925 transitions. [2021-10-28 22:54:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 22:54:47,467 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:47,467 INFO L513 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] [2021-10-28 22:54:47,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 22:54:47,468 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash -22883762, now seen corresponding path program 1 times [2021-10-28 22:54:47,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:47,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290153034] [2021-10-28 22:54:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:47,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:47,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:47,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290153034] [2021-10-28 22:54:47,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290153034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:47,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:47,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:47,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351768789] [2021-10-28 22:54:47,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:47,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:47,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:47,576 INFO L87 Difference]: Start difference. First operand 677 states and 925 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:47,895 INFO L93 Difference]: Finished difference Result 962 states and 1282 transitions. [2021-10-28 22:54:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-28 22:54:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:47,902 INFO L225 Difference]: With dead ends: 962 [2021-10-28 22:54:47,902 INFO L226 Difference]: Without dead ends: 711 [2021-10-28 22:54:47,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-10-28 22:54:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 660. [2021-10-28 22:54:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3740340030911902) internal successors, (889), 659 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 889 transitions. [2021-10-28 22:54:47,964 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 889 transitions. Word has length 29 [2021-10-28 22:54:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:47,965 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 889 transitions. [2021-10-28 22:54:47,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 889 transitions. [2021-10-28 22:54:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 22:54:47,967 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:47,968 INFO L513 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] [2021-10-28 22:54:47,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 22:54:47,968 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -879074465, now seen corresponding path program 1 times [2021-10-28 22:54:47,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:47,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479774396] [2021-10-28 22:54:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:47,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:48,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:48,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479774396] [2021-10-28 22:54:48,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479774396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:48,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:48,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:48,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228972009] [2021-10-28 22:54:48,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:48,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:48,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:48,030 INFO L87 Difference]: Start difference. First operand 660 states and 889 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:48,178 INFO L93 Difference]: Finished difference Result 677 states and 905 transitions. [2021-10-28 22:54:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:54:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-28 22:54:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:48,184 INFO L225 Difference]: With dead ends: 677 [2021-10-28 22:54:48,184 INFO L226 Difference]: Without dead ends: 660 [2021-10-28 22:54:48,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-10-28 22:54:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2021-10-28 22:54:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3554868624420402) internal successors, (877), 659 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 877 transitions. [2021-10-28 22:54:48,244 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 877 transitions. Word has length 31 [2021-10-28 22:54:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:48,244 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 877 transitions. [2021-10-28 22:54:48,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 877 transitions. [2021-10-28 22:54:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 22:54:48,246 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:48,247 INFO L513 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] [2021-10-28 22:54:48,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 22:54:48,249 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2021-10-28 22:54:48,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:48,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250464942] [2021-10-28 22:54:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:48,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:48,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:48,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250464942] [2021-10-28 22:54:48,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250464942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:48,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:48,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:48,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528849267] [2021-10-28 22:54:48,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:48,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:48,317 INFO L87 Difference]: Start difference. First operand 660 states and 877 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:48,591 INFO L93 Difference]: Finished difference Result 732 states and 957 transitions. [2021-10-28 22:54:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-28 22:54:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:48,597 INFO L225 Difference]: With dead ends: 732 [2021-10-28 22:54:48,598 INFO L226 Difference]: Without dead ends: 662 [2021-10-28 22:54:48,599 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-10-28 22:54:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2021-10-28 22:54:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3415765069551777) internal successors, (868), 659 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 868 transitions. [2021-10-28 22:54:48,660 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 868 transitions. Word has length 31 [2021-10-28 22:54:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:48,661 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 868 transitions. [2021-10-28 22:54:48,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 868 transitions. [2021-10-28 22:54:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 22:54:48,663 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:48,663 INFO L513 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] [2021-10-28 22:54:48,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 22:54:48,664 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2021-10-28 22:54:48,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:48,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642916029] [2021-10-28 22:54:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:48,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:48,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:48,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642916029] [2021-10-28 22:54:48,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642916029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:48,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:48,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:48,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058503547] [2021-10-28 22:54:48,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:48,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:48,710 INFO L87 Difference]: Start difference. First operand 660 states and 868 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:48,911 INFO L93 Difference]: Finished difference Result 868 states and 1144 transitions. [2021-10-28 22:54:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-28 22:54:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:48,917 INFO L225 Difference]: With dead ends: 868 [2021-10-28 22:54:48,917 INFO L226 Difference]: Without dead ends: 662 [2021-10-28 22:54:48,918 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-10-28 22:54:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2021-10-28 22:54:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 651 states have (on average 1.337941628264209) internal successors, (871), 661 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 871 transitions. [2021-10-28 22:54:49,009 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 871 transitions. Word has length 31 [2021-10-28 22:54:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:49,009 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 871 transitions. [2021-10-28 22:54:49,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 871 transitions. [2021-10-28 22:54:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 22:54:49,011 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:49,011 INFO L513 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] [2021-10-28 22:54:49,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 22:54:49,011 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash -191087949, now seen corresponding path program 1 times [2021-10-28 22:54:49,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:49,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438117907] [2021-10-28 22:54:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:49,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:49,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:49,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438117907] [2021-10-28 22:54:49,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438117907] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:49,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:49,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:49,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785614769] [2021-10-28 22:54:49,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:49,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:49,088 INFO L87 Difference]: Start difference. First operand 662 states and 871 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:49,244 INFO L93 Difference]: Finished difference Result 729 states and 940 transitions. [2021-10-28 22:54:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 22:54:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-28 22:54:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:49,250 INFO L225 Difference]: With dead ends: 729 [2021-10-28 22:54:49,250 INFO L226 Difference]: Without dead ends: 683 [2021-10-28 22:54:49,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-28 22:54:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-10-28 22:54:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 650. [2021-10-28 22:54:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 639 states have (on average 1.3348982785602503) internal successors, (853), 649 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 853 transitions. [2021-10-28 22:54:49,313 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 853 transitions. Word has length 32 [2021-10-28 22:54:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:49,313 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 853 transitions. [2021-10-28 22:54:49,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2021-10-28 22:54:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 22:54:49,315 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:49,316 INFO L513 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] [2021-10-28 22:54:49,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 22:54:49,316 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -311747134, now seen corresponding path program 1 times [2021-10-28 22:54:49,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:49,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083850715] [2021-10-28 22:54:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:49,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:49,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:49,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083850715] [2021-10-28 22:54:49,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083850715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:49,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:49,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:49,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552080641] [2021-10-28 22:54:49,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:49,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:49,388 INFO L87 Difference]: Start difference. First operand 650 states and 853 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:49,510 INFO L93 Difference]: Finished difference Result 662 states and 864 transitions. [2021-10-28 22:54:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:54:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-28 22:54:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:49,520 INFO L225 Difference]: With dead ends: 662 [2021-10-28 22:54:49,520 INFO L226 Difference]: Without dead ends: 641 [2021-10-28 22:54:49,522 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-10-28 22:54:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2021-10-28 22:54:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 630 states have (on average 1.3349206349206348) internal successors, (841), 640 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 841 transitions. [2021-10-28 22:54:49,580 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 841 transitions. Word has length 32 [2021-10-28 22:54:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:49,581 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 841 transitions. [2021-10-28 22:54:49,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 841 transitions. [2021-10-28 22:54:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 22:54:49,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:49,583 INFO L513 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] [2021-10-28 22:54:49,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 22:54:49,584 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2021-10-28 22:54:49,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:49,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066214500] [2021-10-28 22:54:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:49,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:49,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:49,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066214500] [2021-10-28 22:54:49,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066214500] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:49,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:49,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:49,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584136504] [2021-10-28 22:54:49,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:49,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:49,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:49,649 INFO L87 Difference]: Start difference. First operand 641 states and 841 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:49,769 INFO L93 Difference]: Finished difference Result 821 states and 1071 transitions. [2021-10-28 22:54:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-28 22:54:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:49,774 INFO L225 Difference]: With dead ends: 821 [2021-10-28 22:54:49,774 INFO L226 Difference]: Without dead ends: 617 [2021-10-28 22:54:49,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-10-28 22:54:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 601. [2021-10-28 22:54:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 590 states have (on average 1.3271186440677967) internal successors, (783), 600 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 783 transitions. [2021-10-28 22:54:49,844 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 783 transitions. Word has length 32 [2021-10-28 22:54:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:49,845 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 783 transitions. [2021-10-28 22:54:49,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 783 transitions. [2021-10-28 22:54:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:54:49,847 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:49,847 INFO L513 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] [2021-10-28 22:54:49,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 22:54:49,848 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2021-10-28 22:54:49,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:49,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000808374] [2021-10-28 22:54:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:49,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:49,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:49,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000808374] [2021-10-28 22:54:49,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000808374] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:49,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:49,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:49,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272839872] [2021-10-28 22:54:49,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:49,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:49,916 INFO L87 Difference]: Start difference. First operand 601 states and 783 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:50,022 INFO L93 Difference]: Finished difference Result 644 states and 827 transitions. [2021-10-28 22:54:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:54:50,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-28 22:54:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:50,027 INFO L225 Difference]: With dead ends: 644 [2021-10-28 22:54:50,028 INFO L226 Difference]: Without dead ends: 620 [2021-10-28 22:54:50,028 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-10-28 22:54:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 601. [2021-10-28 22:54:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 590 states have (on average 1.3254237288135593) internal successors, (782), 600 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 782 transitions. [2021-10-28 22:54:50,084 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 782 transitions. Word has length 33 [2021-10-28 22:54:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:50,085 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 782 transitions. [2021-10-28 22:54:50,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 782 transitions. [2021-10-28 22:54:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:54:50,087 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:50,087 INFO L513 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] [2021-10-28 22:54:50,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 22:54:50,088 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2021-10-28 22:54:50,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:50,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385378072] [2021-10-28 22:54:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:50,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:50,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:50,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385378072] [2021-10-28 22:54:50,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385378072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:50,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:50,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:50,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428498814] [2021-10-28 22:54:50,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:50,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:50,143 INFO L87 Difference]: Start difference. First operand 601 states and 782 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:50,356 INFO L93 Difference]: Finished difference Result 732 states and 939 transitions. [2021-10-28 22:54:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-28 22:54:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:50,362 INFO L225 Difference]: With dead ends: 732 [2021-10-28 22:54:50,362 INFO L226 Difference]: Without dead ends: 712 [2021-10-28 22:54:50,363 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-10-28 22:54:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 651. [2021-10-28 22:54:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 640 states have (on average 1.309375) internal successors, (838), 650 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 838 transitions. [2021-10-28 22:54:50,429 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 838 transitions. Word has length 33 [2021-10-28 22:54:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:50,430 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 838 transitions. [2021-10-28 22:54:50,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 838 transitions. [2021-10-28 22:54:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:54:50,432 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:50,432 INFO L513 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] [2021-10-28 22:54:50,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 22:54:50,433 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1257835912, now seen corresponding path program 1 times [2021-10-28 22:54:50,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:50,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373921241] [2021-10-28 22:54:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:50,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:50,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:50,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373921241] [2021-10-28 22:54:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373921241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:50,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:50,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:50,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655327058] [2021-10-28 22:54:50,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:50,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:50,475 INFO L87 Difference]: Start difference. First operand 651 states and 838 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:50,779 INFO L93 Difference]: Finished difference Result 1258 states and 1614 transitions. [2021-10-28 22:54:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-28 22:54:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:50,787 INFO L225 Difference]: With dead ends: 1258 [2021-10-28 22:54:50,787 INFO L226 Difference]: Without dead ends: 984 [2021-10-28 22:54:50,790 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2021-10-28 22:54:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 688. [2021-10-28 22:54:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 677 states have (on average 1.3116691285081241) internal successors, (888), 687 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 888 transitions. [2021-10-28 22:54:50,864 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 888 transitions. Word has length 33 [2021-10-28 22:54:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:50,865 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 888 transitions. [2021-10-28 22:54:50,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 888 transitions. [2021-10-28 22:54:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:54:50,867 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:50,867 INFO L513 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] [2021-10-28 22:54:50,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 22:54:50,868 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2021-10-28 22:54:50,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:50,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211357702] [2021-10-28 22:54:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:50,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:50,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:50,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211357702] [2021-10-28 22:54:50,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211357702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:50,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:50,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:50,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500074294] [2021-10-28 22:54:50,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:50,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:50,922 INFO L87 Difference]: Start difference. First operand 688 states and 888 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:51,150 INFO L93 Difference]: Finished difference Result 712 states and 912 transitions. [2021-10-28 22:54:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-28 22:54:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:51,155 INFO L225 Difference]: With dead ends: 712 [2021-10-28 22:54:51,155 INFO L226 Difference]: Without dead ends: 625 [2021-10-28 22:54:51,156 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-10-28 22:54:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 607. [2021-10-28 22:54:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 596 states have (on average 1.2969798657718121) internal successors, (773), 606 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 773 transitions. [2021-10-28 22:54:51,224 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 773 transitions. Word has length 33 [2021-10-28 22:54:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:51,224 INFO L470 AbstractCegarLoop]: Abstraction has 607 states and 773 transitions. [2021-10-28 22:54:51,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 773 transitions. [2021-10-28 22:54:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 22:54:51,226 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:51,226 INFO L513 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] [2021-10-28 22:54:51,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 22:54:51,227 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1740926462, now seen corresponding path program 1 times [2021-10-28 22:54:51,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:51,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265974172] [2021-10-28 22:54:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:51,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:51,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:51,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265974172] [2021-10-28 22:54:51,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265974172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:51,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:51,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:51,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513199929] [2021-10-28 22:54:51,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:51,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:51,307 INFO L87 Difference]: Start difference. First operand 607 states and 773 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:51,629 INFO L93 Difference]: Finished difference Result 645 states and 809 transitions. [2021-10-28 22:54:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:51,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-28 22:54:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:51,635 INFO L225 Difference]: With dead ends: 645 [2021-10-28 22:54:51,635 INFO L226 Difference]: Without dead ends: 642 [2021-10-28 22:54:51,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-10-28 22:54:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 612. [2021-10-28 22:54:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 601 states have (on average 1.2945091514143094) internal successors, (778), 611 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 778 transitions. [2021-10-28 22:54:51,722 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 778 transitions. Word has length 34 [2021-10-28 22:54:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:51,723 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 778 transitions. [2021-10-28 22:54:51,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 778 transitions. [2021-10-28 22:54:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 22:54:51,725 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:51,725 INFO L513 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] [2021-10-28 22:54:51,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 22:54:51,726 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1740938378, now seen corresponding path program 1 times [2021-10-28 22:54:51,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:51,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133675887] [2021-10-28 22:54:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:51,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:51,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:51,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133675887] [2021-10-28 22:54:51,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133675887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:51,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:51,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:51,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938590799] [2021-10-28 22:54:51,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:51,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:51,790 INFO L87 Difference]: Start difference. First operand 612 states and 778 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:52,181 INFO L93 Difference]: Finished difference Result 895 states and 1122 transitions. [2021-10-28 22:54:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-28 22:54:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:52,200 INFO L225 Difference]: With dead ends: 895 [2021-10-28 22:54:52,200 INFO L226 Difference]: Without dead ends: 872 [2021-10-28 22:54:52,201 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-28 22:54:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-10-28 22:54:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 610. [2021-10-28 22:54:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 599 states have (on average 1.2921535893155258) internal successors, (774), 609 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2021-10-28 22:54:52,270 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 34 [2021-10-28 22:54:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:52,271 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2021-10-28 22:54:52,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2021-10-28 22:54:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 22:54:52,273 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:52,273 INFO L513 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] [2021-10-28 22:54:52,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 22:54:52,274 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash -935530627, now seen corresponding path program 1 times [2021-10-28 22:54:52,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:52,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452417850] [2021-10-28 22:54:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:52,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:52,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:52,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452417850] [2021-10-28 22:54:52,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452417850] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:52,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:52,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:52,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848133952] [2021-10-28 22:54:52,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:52,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:52,339 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:52,598 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2021-10-28 22:54:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:52,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-28 22:54:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:52,604 INFO L225 Difference]: With dead ends: 670 [2021-10-28 22:54:52,604 INFO L226 Difference]: Without dead ends: 629 [2021-10-28 22:54:52,605 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-28 22:54:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 576. [2021-10-28 22:54:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 565 states have (on average 1.2991150442477877) internal successors, (734), 575 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 734 transitions. [2021-10-28 22:54:52,707 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 734 transitions. Word has length 35 [2021-10-28 22:54:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:52,707 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 734 transitions. [2021-10-28 22:54:52,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 734 transitions. [2021-10-28 22:54:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 22:54:52,709 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:52,709 INFO L513 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] [2021-10-28 22:54:52,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 22:54:52,710 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2021-10-28 22:54:52,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:52,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543100124] [2021-10-28 22:54:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:52,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:52,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:52,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543100124] [2021-10-28 22:54:52,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543100124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:52,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:52,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:52,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142145895] [2021-10-28 22:54:52,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:52,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:52,765 INFO L87 Difference]: Start difference. First operand 576 states and 734 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:53,107 INFO L93 Difference]: Finished difference Result 1269 states and 1627 transitions. [2021-10-28 22:54:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:53,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-10-28 22:54:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:53,116 INFO L225 Difference]: With dead ends: 1269 [2021-10-28 22:54:53,117 INFO L226 Difference]: Without dead ends: 1083 [2021-10-28 22:54:53,118 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:54:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-10-28 22:54:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 583. [2021-10-28 22:54:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 572 states have (on average 1.2954545454545454) internal successors, (741), 582 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 741 transitions. [2021-10-28 22:54:53,192 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 741 transitions. Word has length 35 [2021-10-28 22:54:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:53,193 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 741 transitions. [2021-10-28 22:54:53,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 741 transitions. [2021-10-28 22:54:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:54:53,195 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:53,195 INFO L513 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] [2021-10-28 22:54:53,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 22:54:53,196 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2021-10-28 22:54:53,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:53,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809029403] [2021-10-28 22:54:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:53,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:53,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:53,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809029403] [2021-10-28 22:54:53,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809029403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:53,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:53,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:53,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056993030] [2021-10-28 22:54:53,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:53,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:53,280 INFO L87 Difference]: Start difference. First operand 583 states and 741 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:53,672 INFO L93 Difference]: Finished difference Result 1334 states and 1716 transitions. [2021-10-28 22:54:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-28 22:54:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:53,681 INFO L225 Difference]: With dead ends: 1334 [2021-10-28 22:54:53,681 INFO L226 Difference]: Without dead ends: 1118 [2021-10-28 22:54:53,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:54:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-10-28 22:54:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 583. [2021-10-28 22:54:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 572 states have (on average 1.2954545454545454) internal successors, (741), 582 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 741 transitions. [2021-10-28 22:54:53,776 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 741 transitions. Word has length 36 [2021-10-28 22:54:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:53,777 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 741 transitions. [2021-10-28 22:54:53,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 741 transitions. [2021-10-28 22:54:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:54:53,779 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:53,779 INFO L513 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] [2021-10-28 22:54:53,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 22:54:53,780 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -593051815, now seen corresponding path program 1 times [2021-10-28 22:54:53,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:53,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476708271] [2021-10-28 22:54:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:53,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:53,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:53,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476708271] [2021-10-28 22:54:53,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476708271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:53,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:53,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:53,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46252431] [2021-10-28 22:54:53,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:53,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:53,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:53,839 INFO L87 Difference]: Start difference. First operand 583 states and 741 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:53,945 INFO L93 Difference]: Finished difference Result 843 states and 1076 transitions. [2021-10-28 22:54:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-28 22:54:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:53,951 INFO L225 Difference]: With dead ends: 843 [2021-10-28 22:54:53,951 INFO L226 Difference]: Without dead ends: 644 [2021-10-28 22:54:53,954 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-10-28 22:54:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 571. [2021-10-28 22:54:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 563 states have (on average 1.2841918294849024) internal successors, (723), 570 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 723 transitions. [2021-10-28 22:54:54,030 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 723 transitions. Word has length 36 [2021-10-28 22:54:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:54,030 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 723 transitions. [2021-10-28 22:54:54,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 723 transitions. [2021-10-28 22:54:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 22:54:54,032 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:54,033 INFO L513 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] [2021-10-28 22:54:54,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 22:54:54,033 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1515937655, now seen corresponding path program 1 times [2021-10-28 22:54:54,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:54,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026915667] [2021-10-28 22:54:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:54,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:54,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:54,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026915667] [2021-10-28 22:54:54,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026915667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:54,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:54,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:54,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16064476] [2021-10-28 22:54:54,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:54,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:54,095 INFO L87 Difference]: Start difference. First operand 571 states and 723 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:54,219 INFO L93 Difference]: Finished difference Result 600 states and 751 transitions. [2021-10-28 22:54:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:54:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-28 22:54:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:54,224 INFO L225 Difference]: With dead ends: 600 [2021-10-28 22:54:54,225 INFO L226 Difference]: Without dead ends: 581 [2021-10-28 22:54:54,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-10-28 22:54:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 568. [2021-10-28 22:54:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 560 states have (on average 1.2803571428571427) internal successors, (717), 567 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 717 transitions. [2021-10-28 22:54:54,298 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 717 transitions. Word has length 37 [2021-10-28 22:54:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:54,299 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 717 transitions. [2021-10-28 22:54:54,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 717 transitions. [2021-10-28 22:54:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 22:54:54,301 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:54,301 INFO L513 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] [2021-10-28 22:54:54,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 22:54:54,301 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2021-10-28 22:54:54,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:54,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84834323] [2021-10-28 22:54:54,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:54,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:54,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:54,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84834323] [2021-10-28 22:54:54,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84834323] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:54,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:54,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:54,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226576655] [2021-10-28 22:54:54,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:54,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:54,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:54,447 INFO L87 Difference]: Start difference. First operand 568 states and 717 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:54,672 INFO L93 Difference]: Finished difference Result 757 states and 959 transitions. [2021-10-28 22:54:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-28 22:54:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:54,677 INFO L225 Difference]: With dead ends: 757 [2021-10-28 22:54:54,677 INFO L226 Difference]: Without dead ends: 538 [2021-10-28 22:54:54,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-28 22:54:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 533. [2021-10-28 22:54:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 526 states have (on average 1.2661596958174905) internal successors, (666), 532 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 666 transitions. [2021-10-28 22:54:54,804 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 666 transitions. Word has length 37 [2021-10-28 22:54:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:54,805 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 666 transitions. [2021-10-28 22:54:54,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 666 transitions. [2021-10-28 22:54:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 22:54:54,807 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:54,807 INFO L513 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] [2021-10-28 22:54:54,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 22:54:54,808 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2021-10-28 22:54:54,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:54,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096349964] [2021-10-28 22:54:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:54,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:54,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:54,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096349964] [2021-10-28 22:54:54,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096349964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:54,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:54,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:54,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102827907] [2021-10-28 22:54:54,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:54,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:54,880 INFO L87 Difference]: Start difference. First operand 533 states and 666 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:55,162 INFO L93 Difference]: Finished difference Result 714 states and 899 transitions. [2021-10-28 22:54:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-10-28 22:54:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:55,167 INFO L225 Difference]: With dead ends: 714 [2021-10-28 22:54:55,167 INFO L226 Difference]: Without dead ends: 530 [2021-10-28 22:54:55,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-28 22:54:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-10-28 22:54:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 523 states have (on average 1.2562141491395793) internal successors, (657), 529 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 657 transitions. [2021-10-28 22:54:55,268 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 657 transitions. Word has length 38 [2021-10-28 22:54:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:55,269 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 657 transitions. [2021-10-28 22:54:55,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 657 transitions. [2021-10-28 22:54:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 22:54:55,274 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:55,274 INFO L513 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] [2021-10-28 22:54:55,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 22:54:55,276 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2061375645, now seen corresponding path program 1 times [2021-10-28 22:54:55,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:55,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939880593] [2021-10-28 22:54:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:55,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:55,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:55,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939880593] [2021-10-28 22:54:55,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939880593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:55,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:55,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:54:55,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186453099] [2021-10-28 22:54:55,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:54:55,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:54:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:55,420 INFO L87 Difference]: Start difference. First operand 530 states and 657 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:55,946 INFO L93 Difference]: Finished difference Result 775 states and 946 transitions. [2021-10-28 22:54:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:54:55,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-10-28 22:54:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:55,952 INFO L225 Difference]: With dead ends: 775 [2021-10-28 22:54:55,953 INFO L226 Difference]: Without dead ends: 758 [2021-10-28 22:54:55,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-28 22:54:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-10-28 22:54:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 529. [2021-10-28 22:54:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 522 states have (on average 1.2547892720306513) internal successors, (655), 528 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 655 transitions. [2021-10-28 22:54:56,049 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 655 transitions. Word has length 39 [2021-10-28 22:54:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:56,050 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 655 transitions. [2021-10-28 22:54:56,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 655 transitions. [2021-10-28 22:54:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 22:54:56,052 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:56,052 INFO L513 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] [2021-10-28 22:54:56,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 22:54:56,053 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash -917711350, now seen corresponding path program 1 times [2021-10-28 22:54:56,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:56,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293763512] [2021-10-28 22:54:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:56,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:56,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:56,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293763512] [2021-10-28 22:54:56,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293763512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:56,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:56,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:56,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795580469] [2021-10-28 22:54:56,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:56,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:56,142 INFO L87 Difference]: Start difference. First operand 529 states and 655 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:56,498 INFO L93 Difference]: Finished difference Result 554 states and 676 transitions. [2021-10-28 22:54:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-10-28 22:54:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:56,502 INFO L225 Difference]: With dead ends: 554 [2021-10-28 22:54:56,502 INFO L226 Difference]: Without dead ends: 530 [2021-10-28 22:54:56,503 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-28 22:54:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 516. [2021-10-28 22:54:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 509 states have (on average 1.2573673870333988) internal successors, (640), 515 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 640 transitions. [2021-10-28 22:54:56,601 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 640 transitions. Word has length 40 [2021-10-28 22:54:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:56,601 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 640 transitions. [2021-10-28 22:54:56,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 640 transitions. [2021-10-28 22:54:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 22:54:56,603 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:56,603 INFO L513 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] [2021-10-28 22:54:56,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 22:54:56,604 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -436735014, now seen corresponding path program 1 times [2021-10-28 22:54:56,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:56,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784314096] [2021-10-28 22:54:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:56,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:56,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:56,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784314096] [2021-10-28 22:54:56,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784314096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:56,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:56,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:56,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627546614] [2021-10-28 22:54:56,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:56,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:56,672 INFO L87 Difference]: Start difference. First operand 516 states and 640 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:56,821 INFO L93 Difference]: Finished difference Result 539 states and 660 transitions. [2021-10-28 22:54:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:54:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-10-28 22:54:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:56,825 INFO L225 Difference]: With dead ends: 539 [2021-10-28 22:54:56,825 INFO L226 Difference]: Without dead ends: 518 [2021-10-28 22:54:56,826 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-10-28 22:54:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 508. [2021-10-28 22:54:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 501 states have (on average 1.2574850299401197) internal successors, (630), 507 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-10-28 22:54:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 630 transitions. [2021-10-28 22:54:56,951 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 630 transitions. Word has length 41 [2021-10-28 22:54:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:56,952 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 630 transitions. [2021-10-28 22:54:56,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 630 transitions. [2021-10-28 22:54:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 22:54:56,954 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:56,954 INFO L513 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] [2021-10-28 22:54:56,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-28 22:54:56,954 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1643790660, now seen corresponding path program 1 times [2021-10-28 22:54:56,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:56,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287949526] [2021-10-28 22:54:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:56,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:57,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:57,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287949526] [2021-10-28 22:54:57,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287949526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:57,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:57,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:57,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940810480] [2021-10-28 22:54:57,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:57,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:57,015 INFO L87 Difference]: Start difference. First operand 508 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:57,138 INFO L93 Difference]: Finished difference Result 526 states and 647 transitions. [2021-10-28 22:54:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:54:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-10-28 22:54:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:57,141 INFO L225 Difference]: With dead ends: 526 [2021-10-28 22:54:57,141 INFO L226 Difference]: Without dead ends: 508 [2021-10-28 22:54:57,141 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-10-28 22:54:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 494. [2021-10-28 22:54:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 487 states have (on average 1.2607802874743326) internal successors, (614), 493 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 614 transitions. [2021-10-28 22:54:57,237 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 614 transitions. Word has length 41 [2021-10-28 22:54:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:57,237 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 614 transitions. [2021-10-28 22:54:57,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 614 transitions. [2021-10-28 22:54:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 22:54:57,239 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:57,240 INFO L513 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] [2021-10-28 22:54:57,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-28 22:54:57,240 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2021-10-28 22:54:57,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:57,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173961354] [2021-10-28 22:54:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:57,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:57,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:57,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173961354] [2021-10-28 22:54:57,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173961354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:57,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:57,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:57,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225986845] [2021-10-28 22:54:57,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:57,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:57,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:57,335 INFO L87 Difference]: Start difference. First operand 494 states and 614 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:57,640 INFO L93 Difference]: Finished difference Result 815 states and 998 transitions. [2021-10-28 22:54:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:54:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-10-28 22:54:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:57,643 INFO L225 Difference]: With dead ends: 815 [2021-10-28 22:54:57,644 INFO L226 Difference]: Without dead ends: 659 [2021-10-28 22:54:57,645 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-10-28 22:54:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 488. [2021-10-28 22:54:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 481 states have (on average 1.2515592515592515) internal successors, (602), 487 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 602 transitions. [2021-10-28 22:54:57,745 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 602 transitions. Word has length 41 [2021-10-28 22:54:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:57,745 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 602 transitions. [2021-10-28 22:54:57,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 602 transitions. [2021-10-28 22:54:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 22:54:57,747 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:57,748 INFO L513 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] [2021-10-28 22:54:57,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-28 22:54:57,748 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2021-10-28 22:54:57,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:57,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066730385] [2021-10-28 22:54:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:57,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:57,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:57,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066730385] [2021-10-28 22:54:57,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066730385] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:57,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:57,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:54:57,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534863658] [2021-10-28 22:54:57,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:54:57,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:54:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:54:57,820 INFO L87 Difference]: Start difference. First operand 488 states and 602 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:57,997 INFO L93 Difference]: Finished difference Result 644 states and 779 transitions. [2021-10-28 22:54:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:54:57,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-10-28 22:54:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:58,000 INFO L225 Difference]: With dead ends: 644 [2021-10-28 22:54:58,001 INFO L226 Difference]: Without dead ends: 579 [2021-10-28 22:54:58,002 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-10-28 22:54:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 492. [2021-10-28 22:54:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 485 states have (on average 1.2494845360824742) internal successors, (606), 491 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 606 transitions. [2021-10-28 22:54:58,127 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 606 transitions. Word has length 42 [2021-10-28 22:54:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:58,128 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 606 transitions. [2021-10-28 22:54:58,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 606 transitions. [2021-10-28 22:54:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 22:54:58,133 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:58,133 INFO L513 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] [2021-10-28 22:54:58,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-28 22:54:58,133 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2021-10-28 22:54:58,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:58,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455503701] [2021-10-28 22:54:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:58,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:58,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:58,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455503701] [2021-10-28 22:54:58,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455503701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:58,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:58,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:58,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017267472] [2021-10-28 22:54:58,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:58,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:58,196 INFO L87 Difference]: Start difference. First operand 492 states and 606 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:58,352 INFO L93 Difference]: Finished difference Result 516 states and 628 transitions. [2021-10-28 22:54:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:54:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-10-28 22:54:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:58,354 INFO L225 Difference]: With dead ends: 516 [2021-10-28 22:54:58,355 INFO L226 Difference]: Without dead ends: 444 [2021-10-28 22:54:58,355 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-28 22:54:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 430. [2021-10-28 22:54:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 424 states have (on average 1.2382075471698113) internal successors, (525), 429 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 525 transitions. [2021-10-28 22:54:58,471 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 525 transitions. Word has length 42 [2021-10-28 22:54:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:58,471 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 525 transitions. [2021-10-28 22:54:58,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 525 transitions. [2021-10-28 22:54:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 22:54:58,479 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:58,479 INFO L513 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-10-28 22:54:58,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-28 22:54:58,480 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1579373080, now seen corresponding path program 1 times [2021-10-28 22:54:58,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:58,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364495473] [2021-10-28 22:54:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:58,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:58,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:58,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364495473] [2021-10-28 22:54:58,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364495473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:58,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:58,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:54:58,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414900073] [2021-10-28 22:54:58,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:54:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:54:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:58,588 INFO L87 Difference]: Start difference. First operand 430 states and 525 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-10-28 22:54:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:58,929 INFO L93 Difference]: Finished difference Result 448 states and 543 transitions. [2021-10-28 22:54:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 22:54:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-10-28 22:54:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:58,933 INFO L225 Difference]: With dead ends: 448 [2021-10-28 22:54:58,933 INFO L226 Difference]: Without dead ends: 335 [2021-10-28 22:54:58,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 22:54:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-10-28 22:54:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 315. [2021-10-28 22:54:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2483870967741935) internal successors, (387), 314 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-10-28 22:54:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 387 transitions. [2021-10-28 22:54:59,027 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 387 transitions. Word has length 44 [2021-10-28 22:54:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:59,027 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 387 transitions. [2021-10-28 22:54:59,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-10-28 22:54:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 387 transitions. [2021-10-28 22:54:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 22:54:59,030 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:59,030 INFO L513 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-10-28 22:54:59,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-28 22:54:59,031 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2021-10-28 22:54:59,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:59,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943534382] [2021-10-28 22:54:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:59,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:59,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:59,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943534382] [2021-10-28 22:54:59,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943534382] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:59,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:59,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:54:59,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615031015] [2021-10-28 22:54:59,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:54:59,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:59,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:54:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:54:59,128 INFO L87 Difference]: Start difference. First operand 315 states and 387 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-10-28 22:54:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:59,408 INFO L93 Difference]: Finished difference Result 708 states and 883 transitions. [2021-10-28 22:54:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:54:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-10-28 22:54:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:59,410 INFO L225 Difference]: With dead ends: 708 [2021-10-28 22:54:59,411 INFO L226 Difference]: Without dead ends: 578 [2021-10-28 22:54:59,412 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:54:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-10-28 22:54:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 315. [2021-10-28 22:54:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2451612903225806) internal successors, (386), 314 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-10-28 22:54:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 386 transitions. [2021-10-28 22:54:59,485 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 386 transitions. Word has length 44 [2021-10-28 22:54:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:59,486 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 386 transitions. [2021-10-28 22:54:59,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-10-28 22:54:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 386 transitions. [2021-10-28 22:54:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 22:54:59,487 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:59,488 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:59,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-28 22:54:59,488 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2021-10-28 22:54:59,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:59,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121950325] [2021-10-28 22:54:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:59,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:59,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:59,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121950325] [2021-10-28 22:54:59,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121950325] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:59,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:59,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:54:59,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141314247] [2021-10-28 22:54:59,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:59,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:59,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:59,544 INFO L87 Difference]: Start difference. First operand 315 states and 386 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:54:59,673 INFO L93 Difference]: Finished difference Result 448 states and 556 transitions. [2021-10-28 22:54:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:59,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-10-28 22:54:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:54:59,675 INFO L225 Difference]: With dead ends: 448 [2021-10-28 22:54:59,675 INFO L226 Difference]: Without dead ends: 277 [2021-10-28 22:54:59,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-28 22:54:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-10-28 22:54:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.22992700729927) internal successors, (337), 276 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 337 transitions. [2021-10-28 22:54:59,747 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 337 transitions. Word has length 48 [2021-10-28 22:54:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:54:59,748 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 337 transitions. [2021-10-28 22:54:59,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 337 transitions. [2021-10-28 22:54:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 22:54:59,749 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:54:59,750 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:59,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-28 22:54:59,750 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:54:59,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -624384568, now seen corresponding path program 1 times [2021-10-28 22:54:59,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:59,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635578632] [2021-10-28 22:54:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:59,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:59,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:59,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635578632] [2021-10-28 22:54:59,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635578632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:59,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:59,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:54:59,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973331072] [2021-10-28 22:54:59,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:54:59,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:54:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:59,825 INFO L87 Difference]: Start difference. First operand 277 states and 337 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:55:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:55:00,094 INFO L93 Difference]: Finished difference Result 382 states and 459 transitions. [2021-10-28 22:55:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 22:55:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-10-28 22:55:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:55:00,096 INFO L225 Difference]: With dead ends: 382 [2021-10-28 22:55:00,096 INFO L226 Difference]: Without dead ends: 364 [2021-10-28 22:55:00,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-10-28 22:55:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-28 22:55:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 277. [2021-10-28 22:55:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 276 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:55:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2021-10-28 22:55:00,163 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 54 [2021-10-28 22:55:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:55:00,163 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2021-10-28 22:55:00,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:55:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2021-10-28 22:55:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-28 22:55:00,165 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:55:00,165 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:55:00,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-28 22:55:00,166 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:55:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:55:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2021036311, now seen corresponding path program 1 times [2021-10-28 22:55:00,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:55:00,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157018965] [2021-10-28 22:55:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:55:00,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:55:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:55:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:55:00,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:55:00,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157018965] [2021-10-28 22:55:00,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157018965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:55:00,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:55:00,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:55:00,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434539248] [2021-10-28 22:55:00,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:55:00,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:55:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:55:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:55:00,206 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-10-28 22:55:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:55:00,314 INFO L93 Difference]: Finished difference Result 390 states and 468 transitions. [2021-10-28 22:55:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:55:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-10-28 22:55:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:55:00,316 INFO L225 Difference]: With dead ends: 390 [2021-10-28 22:55:00,317 INFO L226 Difference]: Without dead ends: 331 [2021-10-28 22:55:00,318 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:55:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-28 22:55:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 277. [2021-10-28 22:55:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.218978102189781) internal successors, (334), 276 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:55:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 334 transitions. [2021-10-28 22:55:00,382 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 334 transitions. Word has length 57 [2021-10-28 22:55:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:55:00,383 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 334 transitions. [2021-10-28 22:55:00,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-10-28 22:55:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 334 transitions. [2021-10-28 22:55:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 22:55:00,385 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:55:00,385 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:55:00,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-28 22:55:00,385 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-28 22:55:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:55:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -576201386, now seen corresponding path program 1 times [2021-10-28 22:55:00,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:55:00,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990552501] [2021-10-28 22:55:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:55:00,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:55:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:55:00,419 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:55:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:55:00,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:55:00,498 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 22:55:00,500 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:55:00,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-28 22:55:00,520 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:55:00,525 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 22:55:00,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 10:55:00 BoogieIcfgContainer [2021-10-28 22:55:00,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 22:55:00,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:55:00,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:55:00,719 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:55:00,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:41" (3/4) ... [2021-10-28 22:55:00,723 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 22:55:00,862 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:55:00,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:55:00,864 INFO L168 Benchmark]: Toolchain (without parser) took 22912.08 ms. Allocated memory was 142.6 MB in the beginning and 434.1 MB in the end (delta: 291.5 MB). Free memory was 109.7 MB in the beginning and 322.6 MB in the end (delta: -212.9 MB). Peak memory consumption was 77.7 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,864 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory was 50.0 MB in the beginning and 49.9 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:55:00,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.66 ms. Allocated memory is still 142.6 MB. Free memory was 109.7 MB in the beginning and 104.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.02 ms. Allocated memory is still 142.6 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,866 INFO L168 Benchmark]: Boogie Preprocessor took 153.33 ms. Allocated memory is still 142.6 MB. Free memory was 93.9 MB in the beginning and 87.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,866 INFO L168 Benchmark]: RCFGBuilder took 2304.16 ms. Allocated memory is still 142.6 MB. Free memory was 87.2 MB in the beginning and 91.2 MB in the end (delta: -4.0 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,867 INFO L168 Benchmark]: TraceAbstraction took 19372.35 ms. Allocated memory was 142.6 MB in the beginning and 434.1 MB in the end (delta: 291.5 MB). Free memory was 90.4 MB in the beginning and 340.4 MB in the end (delta: -250.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,867 INFO L168 Benchmark]: Witness Printer took 143.01 ms. Allocated memory is still 434.1 MB. Free memory was 340.4 MB in the beginning and 322.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 22:55:00,870 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.36 ms. Allocated memory is still 92.3 MB. Free memory was 50.0 MB in the beginning and 49.9 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 768.66 ms. Allocated memory is still 142.6 MB. Free memory was 109.7 MB in the beginning and 104.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 155.02 ms. Allocated memory is still 142.6 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 153.33 ms. Allocated memory is still 142.6 MB. Free memory was 93.9 MB in the beginning and 87.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2304.16 ms. Allocated memory is still 142.6 MB. Free memory was 87.2 MB in the beginning and 91.2 MB in the end (delta: -4.0 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19372.35 ms. Allocated memory was 142.6 MB in the beginning and 434.1 MB in the end (delta: 291.5 MB). Free memory was 90.4 MB in the beginning and 340.4 MB in the end (delta: -250.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Witness Printer took 143.01 ms. Allocated memory is still 434.1 MB. Free memory was 340.4 MB in the beginning and 322.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1627]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int FloppyThread ; [L43] int KernelMode ; [L44] int Suspended ; [L45] int Executive ; [L46] int DiskController ; [L47] int FloppyDiskPeripheral ; [L48] int FlConfigCallBack ; [L49] int MaximumInterfaceType ; [L50] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L51] int myStatus ; [L52] int s ; [L53] int UNLOADED ; [L54] int NP ; [L55] int DC ; [L56] int SKIP1 ; [L57] int SKIP2 ; [L58] int MPR1 ; [L59] int MPR3 ; [L60] int IPC ; [L61] int pended ; [L62] int compRegistered ; [L63] int lowerDriverReturn ; [L64] int setEventCalled ; [L65] int customIrp ; [L88] int PagingReferenceCount = 0; [L89] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L668] int status ; [L669] int irp = __VERIFIER_nondet_int() ; [L670] int pirp ; [L671] int pirp__IoStatus__Status ; [L672] int irp_choice = __VERIFIER_nondet_int() ; [L673] int devobj = __VERIFIER_nondet_int() ; [L674] int __cil_tmp8 ; [L676] FloppyThread = 0 [L677] KernelMode = 0 [L678] Suspended = 0 [L679] Executive = 0 [L680] DiskController = 0 [L681] FloppyDiskPeripheral = 0 [L682] FlConfigCallBack = 0 [L683] MaximumInterfaceType = 0 [L684] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L685] myStatus = 0 [L686] s = 0 [L687] UNLOADED = 0 [L688] NP = 0 [L689] DC = 0 [L690] SKIP1 = 0 [L691] SKIP2 = 0 [L692] MPR1 = 0 [L693] MPR3 = 0 [L694] IPC = 0 [L695] pended = 0 [L696] compRegistered = 0 [L697] lowerDriverReturn = 0 [L698] setEventCalled = 0 [L699] customIrp = 0 [L703] status = 0 [L704] pirp = irp [L71] UNLOADED = 0 [L72] NP = 1 [L73] DC = 2 [L74] SKIP1 = 3 [L75] SKIP2 = 4 [L76] MPR1 = 5 [L77] MPR3 = 6 [L78] IPC = 7 [L79] s = UNLOADED [L80] pended = 0 [L81] compRegistered = 0 [L82] lowerDriverReturn = 0 [L83] setEventCalled = 0 [L84] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L707] COND TRUE status >= 0 [L708] s = NP [L709] customIrp = 0 [L710] setEventCalled = customIrp [L711] lowerDriverReturn = setEventCalled [L712] compRegistered = lowerDriverReturn [L713] pended = compRegistered [L714] pirp__IoStatus__Status = 0 [L715] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L716] COND TRUE irp_choice == 0 [L717] pirp__IoStatus__Status = -1073741637 [L718] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L658] s = NP [L659] pended = 0 [L660] compRegistered = 0 [L661] lowerDriverReturn = 0 [L662] setEventCalled = 0 [L663] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L724] COND FALSE !(status < 0) [L728] int tmp_ndt_1; [L729] tmp_ndt_1 = __VERIFIER_nondet_int() [L730] COND FALSE !(tmp_ndt_1 == 0) [L733] int tmp_ndt_2; [L734] tmp_ndt_2 = __VERIFIER_nondet_int() [L735] COND FALSE !(tmp_ndt_2 == 1) [L738] int tmp_ndt_3; [L739] tmp_ndt_3 = __VERIFIER_nondet_int() [L740] COND FALSE !(tmp_ndt_3 == 2) [L743] int tmp_ndt_4; [L744] tmp_ndt_4 = __VERIFIER_nondet_int() [L745] COND TRUE tmp_ndt_4 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L161] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L162] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L163] int Irp__IoStatus__Information ; [L164] int Irp__IoStatus__Status ; [L165] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L166] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L168] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L169] int disketteExtension__HoldNewRequests ; [L170] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L171] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L173] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L175] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L176] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L177] int irpSp ; [L178] int disketteExtension ; [L179] int ntStatus ; [L180] int doneEvent = __VERIFIER_nondet_int() ; [L181] int irpSp___0 ; [L182] int nextIrpSp ; [L183] int nextIrpSp__Control ; [L184] int irpSp___1 ; [L185] int irpSp__Context ; [L186] int irpSp__Control ; [L187] long __cil_tmp29 ; [L188] long __cil_tmp30 ; [L191] ntStatus = 0 [L192] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L193] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L196] disketteExtension = DeviceObject__DeviceExtension [L197] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L207] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L236] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND FALSE !(! disketteExtension__IsStarted) [L255] disketteExtension__HoldNewRequests = 1 [L98] int status ; [L99] int threadHandle = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L103] int Irp__IoStatus__Status ; [L104] int Irp__IoStatus__Information ; [L105] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L106] int ObjAttributes = __VERIFIER_nondet_int() ; [L107] int __cil_tmp12 ; [L108] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L111] COND FALSE !(DisketteExtension__PoweringDown == 1) [L117] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L118] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L150] COND TRUE pended == 0 [L151] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L157] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L256] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L259] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L260] COND TRUE __cil_tmp29 == 259L [L1066] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1075] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1079] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1086] int tmp_ndt_12; [L1087] tmp_ndt_12 = __VERIFIER_nondet_int() [L1088] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1094] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L265] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L268] disketteExtension__FloppyThread = 0 [L269] Irp__IoStatus__Status = 0 [L270] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] COND TRUE s == NP [L272] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] Irp__CurrentLocation ++ [L280] Irp__Tail__Overlay__CurrentStackLocation ++ [L968] int returnVal2 ; [L969] int compRetStatus1 ; [L970] int lcontext = __VERIFIER_nondet_int() ; [L971] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L974] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] int tmp_ndt_10; [L988] tmp_ndt_10 = __VERIFIER_nondet_int() [L989] COND TRUE tmp_ndt_10 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1000] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1013] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1017] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1026] COND TRUE s == SKIP1 [L1027] s = SKIP2 [L1028] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1036] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L281] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L427] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L428] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L431] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] status = FloppyPnp(devobj, pirp) [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L788] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L789] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L796] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L797] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L798] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L812] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L813] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1627] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 572 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 49, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 26574 SDtfs, 17457 SDslu, 42437 SDs, 0 SdLazy, 4280 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=4, InterpolantAutomatonStates: 227, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 48 MinimizatonAttempts, 3445 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 22:55:00,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e40fff-edec-476e-81d4-bde41286d873/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...