./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:49:04,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:49:04,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:49:04,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:49:04,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:49:04,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:49:04,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:49:04,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:49:04,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:49:04,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:49:04,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:49:04,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:49:04,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:49:04,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:49:04,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:49:04,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:49:04,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:49:04,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:49:04,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:49:04,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:49:04,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:49:04,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:49:04,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:49:04,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:49:04,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:49:04,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:49:04,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:49:04,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:49:04,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:49:04,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:49:04,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:49:04,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:49:04,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:49:04,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:49:04,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:49:04,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:49:04,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:49:04,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:49:04,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:49:04,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:49:04,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:49:04,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 12:49:04,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:49:04,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:49:04,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:49:04,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:49:04,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:49:04,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:49:04,468 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:49:04,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:49:04,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 12:49:04,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:49:04,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:49:04,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:49:04,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:49:04,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:49:04,470 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:49:04,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:49:04,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:49:04,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:49:04,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:49:04,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:49:04,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:49:04,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:49:04,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:49:04,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 12:49:04,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 12:49:04,472 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:49:04,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:49:04,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:49:04,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:49:04,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-06 12:49:04,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:49:04,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:49:04,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:49:04,689 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:49:04,690 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:49:04,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:49:04,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb2603f/72a605ad7aa84955b70b8f77927563dd/FLAG38d5e4df8 [2021-11-06 12:49:05,233 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:49:05,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:49:05,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb2603f/72a605ad7aa84955b70b8f77927563dd/FLAG38d5e4df8 [2021-11-06 12:49:05,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb2603f/72a605ad7aa84955b70b8f77927563dd [2021-11-06 12:49:05,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:49:05,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:49:05,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:49:05,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:49:05,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:49:05,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:49:05" (1/1) ... [2021-11-06 12:49:05,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382285d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:05, skipping insertion in model container [2021-11-06 12:49:05,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:49:05" (1/1) ... [2021-11-06 12:49:05,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:49:05,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:49:06,396 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-06 12:49:06,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:49:06,421 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:49:06,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-06 12:49:06,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:49:06,719 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:49:06,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06 WrapperNode [2021-11-06 12:49:06,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:49:06,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:49:06,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:49:06,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:49:06,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:06,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:06,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:49:06,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:49:06,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:49:06,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:49:06,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:06,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:06,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:06,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:07,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:07,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:07,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:07,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:49:07,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:49:07,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:49:07,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:49:07,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (1/1) ... [2021-11-06 12:49:07,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:49:07,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:49:07,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 12:49:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 12:49:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 12:49:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-06 12:49:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:49:07,184 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 12:49:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:49:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:49:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:49:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 12:49:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 12:49:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:49:07,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:49:09,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:49:09,976 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-06 12:49:09,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:49:09 BoogieIcfgContainer [2021-11-06 12:49:09,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:49:09,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:49:09,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:49:09,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:49:09,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:49:05" (1/3) ... [2021-11-06 12:49:09,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b84614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:49:09, skipping insertion in model container [2021-11-06 12:49:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:49:06" (2/3) ... [2021-11-06 12:49:09,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b84614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:49:09, skipping insertion in model container [2021-11-06 12:49:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:49:09" (3/3) ... [2021-11-06 12:49:09,986 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:49:09,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:49:09,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-06 12:49:10,039 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:49:10,045 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-11-06 12:49:10,045 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-06 12:49:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 12:49:10,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:10,081 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-11-06 12:49:10,081 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-06 12:49:10,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:10,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543046981] [2021-11-06 12:49:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:10,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:10,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:10,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543046981] [2021-11-06 12:49:10,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543046981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:10,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:10,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:49:10,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686578838] [2021-11-06 12:49:10,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:49:10,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:49:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:10,393 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 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 12.0) internal successors, (36), 2 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-11-06 12:49:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:10,478 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-06 12:49:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:49:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 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-11-06 12:49:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:10,493 INFO L225 Difference]: With dead ends: 2079 [2021-11-06 12:49:10,493 INFO L226 Difference]: Without dead ends: 1011 [2021-11-06 12:49:10,497 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-06 12:49:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-06 12:49:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-06 12:49:10,586 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-06 12:49:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:10,586 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-06 12:49:10,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 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-11-06 12:49:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-06 12:49:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 12:49:10,588 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:10,588 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-11-06 12:49:10,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 12:49:10,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-06 12:49:10,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:10,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348676200] [2021-11-06 12:49:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:10,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:10,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:10,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348676200] [2021-11-06 12:49:10,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348676200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:10,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:10,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:49:10,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066104574] [2021-11-06 12:49:10,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:49:10,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:10,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:49:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:10,685 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-11-06 12:49:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:10,727 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-06 12:49:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:49:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-11-06 12:49:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:10,732 INFO L225 Difference]: With dead ends: 1999 [2021-11-06 12:49:10,732 INFO L226 Difference]: Without dead ends: 1011 [2021-11-06 12:49:10,733 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-11-06 12:49:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-06 12:49:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-06 12:49:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-06 12:49:10,759 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-06 12:49:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:10,760 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-06 12:49:10,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-11-06 12:49:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-06 12:49:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 12:49:10,765 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:10,765 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-11-06 12:49:10,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 12:49:10,766 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-06 12:49:10,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:10,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709048375] [2021-11-06 12:49:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:10,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:10,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:10,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709048375] [2021-11-06 12:49:10,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709048375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:10,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:10,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:49:10,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653092677] [2021-11-06 12:49:10,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:49:10,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:49:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:10,901 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-11-06 12:49:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:10,975 INFO L93 Difference]: Finished difference Result 1999 states and 2956 transitions. [2021-11-06 12:49:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:49:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-11-06 12:49:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:10,984 INFO L225 Difference]: With dead ends: 1999 [2021-11-06 12:49:10,985 INFO L226 Difference]: Without dead ends: 1997 [2021-11-06 12:49:10,986 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-11-06 12:49:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-11-06 12:49:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1013. [2021-11-06 12:49:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.475296442687747) internal successors, (1493), 1012 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1493 transitions. [2021-11-06 12:49:11,017 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1493 transitions. Word has length 39 [2021-11-06 12:49:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:11,017 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1493 transitions. [2021-11-06 12:49:11,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-11-06 12:49:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1493 transitions. [2021-11-06 12:49:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 12:49:11,019 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:11,019 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] [2021-11-06 12:49:11,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 12:49:11,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -660420083, now seen corresponding path program 1 times [2021-11-06 12:49:11,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:11,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498443869] [2021-11-06 12:49:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:11,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:11,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:11,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498443869] [2021-11-06 12:49:11,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498443869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:11,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:11,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:11,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988111268] [2021-11-06 12:49:11,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:49:11,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:49:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:11,122 INFO L87 Difference]: Start difference. First operand 1013 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:11,300 INFO L93 Difference]: Finished difference Result 2989 states and 4423 transitions. [2021-11-06 12:49:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:49:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-11-06 12:49:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:11,307 INFO L225 Difference]: With dead ends: 2989 [2021-11-06 12:49:11,307 INFO L226 Difference]: Without dead ends: 2001 [2021-11-06 12:49:11,310 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2021-11-06 12:49:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1014. [2021-11-06 12:49:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.474827245804541) internal successors, (1494), 1013 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1494 transitions. [2021-11-06 12:49:11,350 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1494 transitions. Word has length 46 [2021-11-06 12:49:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:11,351 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 1494 transitions. [2021-11-06 12:49:11,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1494 transitions. [2021-11-06 12:49:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 12:49:11,352 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:11,353 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-11-06 12:49:11,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 12:49:11,353 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash 32416044, now seen corresponding path program 1 times [2021-11-06 12:49:11,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:11,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486632348] [2021-11-06 12:49:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:11,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:11,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:11,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486632348] [2021-11-06 12:49:11,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486632348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:11,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:11,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:49:11,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844866757] [2021-11-06 12:49:11,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:49:11,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:49:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:49:11,443 INFO L87 Difference]: Start difference. First operand 1014 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-11-06 12:49:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:11,636 INFO L93 Difference]: Finished difference Result 3636 states and 5391 transitions. [2021-11-06 12:49:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:49:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-11-06 12:49:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:11,648 INFO L225 Difference]: With dead ends: 3636 [2021-11-06 12:49:11,648 INFO L226 Difference]: Without dead ends: 3634 [2021-11-06 12:49:11,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:49:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-11-06 12:49:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 1015. [2021-11-06 12:49:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4743589743589745) internal successors, (1495), 1014 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1495 transitions. [2021-11-06 12:49:11,699 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1495 transitions. Word has length 48 [2021-11-06 12:49:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:11,699 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1495 transitions. [2021-11-06 12:49:11,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-11-06 12:49:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1495 transitions. [2021-11-06 12:49:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 12:49:11,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:11,701 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, 1, 1, 1, 1] [2021-11-06 12:49:11,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 12:49:11,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1646884847, now seen corresponding path program 1 times [2021-11-06 12:49:11,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:11,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845086226] [2021-11-06 12:49:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:11,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:11,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:11,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845086226] [2021-11-06 12:49:11,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845086226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:11,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:11,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:11,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552336333] [2021-11-06 12:49:11,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:49:11,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:49:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:11,811 INFO L87 Difference]: Start difference. First operand 1015 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:11,932 INFO L93 Difference]: Finished difference Result 2005 states and 2962 transitions. [2021-11-06 12:49:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:49:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-11-06 12:49:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:11,937 INFO L225 Difference]: With dead ends: 2005 [2021-11-06 12:49:11,937 INFO L226 Difference]: Without dead ends: 1015 [2021-11-06 12:49:11,938 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-11-06 12:49:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-06 12:49:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2021-11-06 12:49:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4733727810650887) internal successors, (1494), 1014 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1494 transitions. [2021-11-06 12:49:11,987 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1494 transitions. Word has length 62 [2021-11-06 12:49:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:11,988 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1494 transitions. [2021-11-06 12:49:11,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1494 transitions. [2021-11-06 12:49:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 12:49:11,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:11,989 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, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:11,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 12:49:11,990 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1521423125, now seen corresponding path program 1 times [2021-11-06 12:49:11,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:11,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881665035] [2021-11-06 12:49:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:11,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:12,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:12,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881665035] [2021-11-06 12:49:12,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881665035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:12,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:12,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:12,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397881632] [2021-11-06 12:49:12,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:49:12,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:49:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:12,073 INFO L87 Difference]: Start difference. First operand 1015 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:12,253 INFO L93 Difference]: Finished difference Result 2994 states and 4425 transitions. [2021-11-06 12:49:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:49:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-11-06 12:49:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:12,259 INFO L225 Difference]: With dead ends: 2994 [2021-11-06 12:49:12,260 INFO L226 Difference]: Without dead ends: 2004 [2021-11-06 12:49:12,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:49:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2021-11-06 12:49:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1019. [2021-11-06 12:49:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4724950884086443) internal successors, (1499), 1018 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1499 transitions. [2021-11-06 12:49:12,321 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1499 transitions. Word has length 64 [2021-11-06 12:49:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:12,321 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1499 transitions. [2021-11-06 12:49:12,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1499 transitions. [2021-11-06 12:49:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 12:49:12,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:12,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:12,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 12:49:12,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -897723055, now seen corresponding path program 1 times [2021-11-06 12:49:12,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:12,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143980836] [2021-11-06 12:49:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:12,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 12:49:12,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:12,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143980836] [2021-11-06 12:49:12,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143980836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:12,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:12,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:12,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129717608] [2021-11-06 12:49:12,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:49:12,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:49:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:12,398 INFO L87 Difference]: Start difference. First operand 1019 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:12,546 INFO L93 Difference]: Finished difference Result 2022 states and 2979 transitions. [2021-11-06 12:49:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:49:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-06 12:49:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:12,550 INFO L225 Difference]: With dead ends: 2022 [2021-11-06 12:49:12,550 INFO L226 Difference]: Without dead ends: 1028 [2021-11-06 12:49:12,552 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-11-06 12:49:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-06 12:49:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2021-11-06 12:49:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4459724950884087) internal successors, (1472), 1018 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1472 transitions. [2021-11-06 12:49:12,608 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1472 transitions. Word has length 67 [2021-11-06 12:49:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:12,609 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1472 transitions. [2021-11-06 12:49:12,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1472 transitions. [2021-11-06 12:49:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 12:49:12,611 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:12,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:12,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 12:49:12,612 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1614523249, now seen corresponding path program 1 times [2021-11-06 12:49:12,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:12,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215407989] [2021-11-06 12:49:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:12,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:12,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:12,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215407989] [2021-11-06 12:49:12,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215407989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:49:12,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739465435] [2021-11-06 12:49:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:12,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:49:12,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:49:12,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 12:49:12,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 12:49:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:13,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 12:49:13,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:49:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:13,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739465435] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:49:13,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:49:13,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-06 12:49:13,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450100846] [2021-11-06 12:49:13,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:49:13,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:49:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:49:13,290 INFO L87 Difference]: Start difference. First operand 1019 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:13,707 INFO L93 Difference]: Finished difference Result 3987 states and 5785 transitions. [2021-11-06 12:49:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:49:13,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-06 12:49:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:13,716 INFO L225 Difference]: With dead ends: 3987 [2021-11-06 12:49:13,716 INFO L226 Difference]: Without dead ends: 2993 [2021-11-06 12:49:13,717 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:49:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2021-11-06 12:49:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1022. [2021-11-06 12:49:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 1.44564152791381) internal successors, (1476), 1021 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1476 transitions. [2021-11-06 12:49:13,775 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1476 transitions. Word has length 70 [2021-11-06 12:49:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:13,775 INFO L470 AbstractCegarLoop]: Abstraction has 1022 states and 1476 transitions. [2021-11-06 12:49:13,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1476 transitions. [2021-11-06 12:49:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 12:49:13,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:13,778 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:13,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 12:49:13,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:49:13,996 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1542420939, now seen corresponding path program 2 times [2021-11-06 12:49:13,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:13,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869341735] [2021-11-06 12:49:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:13,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:14,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:14,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869341735] [2021-11-06 12:49:14,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869341735] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:49:14,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410312326] [2021-11-06 12:49:14,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 12:49:14,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:49:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:49:14,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 12:49:14,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 12:49:14,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 12:49:14,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 12:49:14,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:49:14,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:49:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-06 12:49:14,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410312326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:14,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 12:49:14,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-11-06 12:49:14,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794285280] [2021-11-06 12:49:14,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:49:14,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:49:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:49:14,865 INFO L87 Difference]: Start difference. First operand 1022 states and 1476 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:15,038 INFO L93 Difference]: Finished difference Result 3657 states and 5318 transitions. [2021-11-06 12:49:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:49:15,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2021-11-06 12:49:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:15,046 INFO L225 Difference]: With dead ends: 3657 [2021-11-06 12:49:15,046 INFO L226 Difference]: Without dead ends: 2660 [2021-11-06 12:49:15,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:49:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2021-11-06 12:49:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 1024. [2021-11-06 12:49:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.444770283479961) internal successors, (1478), 1023 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1478 transitions. [2021-11-06 12:49:15,106 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1478 transitions. Word has length 73 [2021-11-06 12:49:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:15,106 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1478 transitions. [2021-11-06 12:49:15,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1478 transitions. [2021-11-06 12:49:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 12:49:15,108 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:15,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:15,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 12:49:15,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 12:49:15,315 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1076976601, now seen corresponding path program 1 times [2021-11-06 12:49:15,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:15,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846775346] [2021-11-06 12:49:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:15,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:15,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:15,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846775346] [2021-11-06 12:49:15,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846775346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:15,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:15,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:15,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141170682] [2021-11-06 12:49:15,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:49:15,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:49:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:15,371 INFO L87 Difference]: Start difference. First operand 1024 states and 1478 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:15,509 INFO L93 Difference]: Finished difference Result 2855 states and 4145 transitions. [2021-11-06 12:49:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:49:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-06 12:49:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:15,516 INFO L225 Difference]: With dead ends: 2855 [2021-11-06 12:49:15,516 INFO L226 Difference]: Without dead ends: 1856 [2021-11-06 12:49:15,517 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-11-06 12:49:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2021-11-06 12:49:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1027. [2021-11-06 12:49:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4444444444444444) internal successors, (1482), 1026 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1482 transitions. [2021-11-06 12:49:15,582 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1482 transitions. Word has length 77 [2021-11-06 12:49:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:15,583 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1482 transitions. [2021-11-06 12:49:15,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1482 transitions. [2021-11-06 12:49:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 12:49:15,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:15,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:49:15,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 12:49:15,585 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 94341049, now seen corresponding path program 1 times [2021-11-06 12:49:15,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:15,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658637570] [2021-11-06 12:49:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:15,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:15,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-11-06 12:49:15,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:15,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658637570] [2021-11-06 12:49:15,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658637570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:15,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:15,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:49:15,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762898114] [2021-11-06 12:49:15,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:49:15,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:15,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:49:15,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:49:15,735 INFO L87 Difference]: Start difference. First operand 1027 states and 1482 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:16,325 INFO L93 Difference]: Finished difference Result 4818 states and 6998 transitions. [2021-11-06 12:49:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 12:49:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-06 12:49:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:16,337 INFO L225 Difference]: With dead ends: 4818 [2021-11-06 12:49:16,337 INFO L226 Difference]: Without dead ends: 3806 [2021-11-06 12:49:16,339 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-06 12:49:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2021-11-06 12:49:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 1027. [2021-11-06 12:49:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4434697855750487) internal successors, (1481), 1026 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1481 transitions. [2021-11-06 12:49:16,410 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1481 transitions. Word has length 81 [2021-11-06 12:49:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:16,411 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1481 transitions. [2021-11-06 12:49:16,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1481 transitions. [2021-11-06 12:49:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 12:49:16,413 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:16,413 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, 1, 1, 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-11-06 12:49:16,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 12:49:16,413 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:16,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash -641251963, now seen corresponding path program 1 times [2021-11-06 12:49:16,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:16,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179367480] [2021-11-06 12:49:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:16,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:16,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:16,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179367480] [2021-11-06 12:49:16,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179367480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:16,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:16,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:49:16,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580178590] [2021-11-06 12:49:16,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:49:16,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:49:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:49:16,502 INFO L87 Difference]: Start difference. First operand 1027 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:17,117 INFO L93 Difference]: Finished difference Result 6598 states and 9597 transitions. [2021-11-06 12:49:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:49:17,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-06 12:49:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:17,136 INFO L225 Difference]: With dead ends: 6598 [2021-11-06 12:49:17,137 INFO L226 Difference]: Without dead ends: 5596 [2021-11-06 12:49:17,141 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:49:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2021-11-06 12:49:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 1030. [2021-11-06 12:49:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4421768707482994) internal successors, (1484), 1029 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1484 transitions. [2021-11-06 12:49:17,271 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1484 transitions. Word has length 84 [2021-11-06 12:49:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:17,271 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1484 transitions. [2021-11-06 12:49:17,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1484 transitions. [2021-11-06 12:49:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 12:49:17,273 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:17,273 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 12:49:17,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 12:49:17,274 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1309179487, now seen corresponding path program 1 times [2021-11-06 12:49:17,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:17,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795380656] [2021-11-06 12:49:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:17,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-06 12:49:17,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:17,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795380656] [2021-11-06 12:49:17,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795380656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:17,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:17,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:49:17,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220172598] [2021-11-06 12:49:17,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:49:17,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:49:17,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:49:17,316 INFO L87 Difference]: Start difference. First operand 1030 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:49:17,563 INFO L93 Difference]: Finished difference Result 2858 states and 4143 transitions. [2021-11-06 12:49:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:49:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 12:49:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:49:17,567 INFO L225 Difference]: With dead ends: 2858 [2021-11-06 12:49:17,567 INFO L226 Difference]: Without dead ends: 1853 [2021-11-06 12:49:17,568 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-11-06 12:49:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2021-11-06 12:49:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1024. [2021-11-06 12:49:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4408602150537635) internal successors, (1474), 1023 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1474 transitions. [2021-11-06 12:49:17,645 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1474 transitions. Word has length 87 [2021-11-06 12:49:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:49:17,645 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1474 transitions. [2021-11-06 12:49:17,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:49:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1474 transitions. [2021-11-06 12:49:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 12:49:17,647 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:49:17,647 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, 1, 1, 1, 1, 1, 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-11-06 12:49:17,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 12:49:17,647 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:49:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:49:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-06 12:49:17,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:49:17,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533028130] [2021-11-06 12:49:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:49:17,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:49:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:49:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:49:18,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:49:18,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533028130] [2021-11-06 12:49:18,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533028130] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:49:18,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:49:18,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-06 12:49:18,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597203232] [2021-11-06 12:49:18,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-06 12:49:18,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:49:18,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-06 12:49:18,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-06 12:49:18,892 INFO L87 Difference]: Start difference. First operand 1024 states and 1474 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:51:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:51:53,373 INFO L93 Difference]: Finished difference Result 23179 states and 34500 transitions. [2021-11-06 12:51:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-06 12:51:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 12:51:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:51:53,456 INFO L225 Difference]: With dead ends: 23179 [2021-11-06 12:51:53,457 INFO L226 Difference]: Without dead ends: 23177 [2021-11-06 12:51:53,472 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9452 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3581, Invalid=23809, Unknown=0, NotChecked=0, Total=27390 [2021-11-06 12:51:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23177 states. [2021-11-06 12:51:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23177 to 1693. [2021-11-06 12:51:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 1.442080378250591) internal successors, (2440), 1692 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:51:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2440 transitions. [2021-11-06 12:51:53,802 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2440 transitions. Word has length 87 [2021-11-06 12:51:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:51:53,803 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2440 transitions. [2021-11-06 12:51:53,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:51:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2440 transitions. [2021-11-06 12:51:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 12:51:53,808 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:51:53,808 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, 1, 1, 1, 1, 1, 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-11-06 12:51:53,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 12:51:53,809 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:51:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:51:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1109733853, now seen corresponding path program 1 times [2021-11-06 12:51:53,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:51:53,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17364646] [2021-11-06 12:51:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:51:53,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:51:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:51:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:51:55,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:51:55,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17364646] [2021-11-06 12:51:55,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17364646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:51:55,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:51:55,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-06 12:51:55,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746686606] [2021-11-06 12:51:55,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-06 12:51:55,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:51:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-06 12:51:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-11-06 12:51:55,061 INFO L87 Difference]: Start difference. First operand 1693 states and 2440 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:54:13,606 INFO L93 Difference]: Finished difference Result 23186 states and 34509 transitions. [2021-11-06 12:54:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-06 12:54:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 12:54:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:54:13,647 INFO L225 Difference]: With dead ends: 23186 [2021-11-06 12:54:13,647 INFO L226 Difference]: Without dead ends: 23184 [2021-11-06 12:54:13,657 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9464 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3626, Invalid=24096, Unknown=0, NotChecked=0, Total=27722 [2021-11-06 12:54:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23184 states. [2021-11-06 12:54:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23184 to 1693. [2021-11-06 12:54:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 1.442080378250591) internal successors, (2440), 1692 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2440 transitions. [2021-11-06 12:54:14,052 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2440 transitions. Word has length 87 [2021-11-06 12:54:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:54:14,052 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2440 transitions. [2021-11-06 12:54:14,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2440 transitions. [2021-11-06 12:54:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 12:54:14,055 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:54:14,055 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, 1, 1, 1, 1, 1, 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-11-06 12:54:14,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 12:54:14,055 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:54:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:54:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 216216861, now seen corresponding path program 1 times [2021-11-06 12:54:14,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:54:14,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878206329] [2021-11-06 12:54:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:54:14,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:54:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:54:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:54:14,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:54:14,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878206329] [2021-11-06 12:54:14,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878206329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:54:14,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:54:14,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:54:14,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601208061] [2021-11-06 12:54:14,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:54:14,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:54:14,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:54:14,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:54:14,173 INFO L87 Difference]: Start difference. First operand 1693 states and 2440 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:54:14,482 INFO L93 Difference]: Finished difference Result 2692 states and 3887 transitions. [2021-11-06 12:54:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:54:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-06 12:54:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:54:14,485 INFO L225 Difference]: With dead ends: 2692 [2021-11-06 12:54:14,485 INFO L226 Difference]: Without dead ends: 1690 [2021-11-06 12:54:14,487 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-11-06 12:54:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2021-11-06 12:54:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1690. [2021-11-06 12:54:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.4422735346358793) internal successors, (2436), 1689 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2436 transitions. [2021-11-06 12:54:14,817 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2436 transitions. Word has length 87 [2021-11-06 12:54:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:54:14,817 INFO L470 AbstractCegarLoop]: Abstraction has 1690 states and 2436 transitions. [2021-11-06 12:54:14,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2436 transitions. [2021-11-06 12:54:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 12:54:14,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:54:14,820 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 12:54:14,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 12:54:14,820 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:54:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:54:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2062058996, now seen corresponding path program 1 times [2021-11-06 12:54:14,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:54:14,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264671554] [2021-11-06 12:54:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:54:14,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:54:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:54:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:54:15,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:54:15,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264671554] [2021-11-06 12:54:15,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264671554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:54:15,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:54:15,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 12:54:15,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237620838] [2021-11-06 12:54:15,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 12:54:15,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:54:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 12:54:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-06 12:54:15,227 INFO L87 Difference]: Start difference. First operand 1690 states and 2436 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:54:50,923 INFO L93 Difference]: Finished difference Result 21065 states and 31197 transitions. [2021-11-06 12:54:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-06 12:54:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-06 12:54:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:54:50,973 INFO L225 Difference]: With dead ends: 21065 [2021-11-06 12:54:50,974 INFO L226 Difference]: Without dead ends: 19400 [2021-11-06 12:54:50,982 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4953 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2558, Invalid=10782, Unknown=0, NotChecked=0, Total=13340 [2021-11-06 12:54:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19400 states. [2021-11-06 12:54:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19400 to 2544. [2021-11-06 12:54:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2543 states have (on average 1.4628391663389697) internal successors, (3720), 2543 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3720 transitions. [2021-11-06 12:54:51,537 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3720 transitions. Word has length 90 [2021-11-06 12:54:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:54:51,537 INFO L470 AbstractCegarLoop]: Abstraction has 2544 states and 3720 transitions. [2021-11-06 12:54:51,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3720 transitions. [2021-11-06 12:54:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 12:54:51,546 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:54:51,546 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 12:54:51,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 12:54:51,547 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:54:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:54:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1009416979, now seen corresponding path program 1 times [2021-11-06 12:54:51,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:54:51,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812662661] [2021-11-06 12:54:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:54:51,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:54:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:54:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:54:51,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:54:51,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812662661] [2021-11-06 12:54:51,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812662661] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:54:51,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370639644] [2021-11-06 12:54:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:54:51,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:54:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:54:51,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 12:54:51,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 12:54:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:54:51,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 12:54:51,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:54:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:54:52,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370639644] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:54:52,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:54:52,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-06 12:54:52,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823981921] [2021-11-06 12:54:52,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:54:52,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:54:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:54:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:54:52,187 INFO L87 Difference]: Start difference. First operand 2544 states and 3720 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:54:53,583 INFO L93 Difference]: Finished difference Result 8333 states and 12156 transitions. [2021-11-06 12:54:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:54:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 12:54:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:54:53,590 INFO L225 Difference]: With dead ends: 8333 [2021-11-06 12:54:53,590 INFO L226 Difference]: Without dead ends: 5814 [2021-11-06 12:54:53,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:54:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2021-11-06 12:54:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 2558. [2021-11-06 12:54:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 1.462651544779038) internal successors, (3740), 2557 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3740 transitions. [2021-11-06 12:54:54,101 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3740 transitions. Word has length 95 [2021-11-06 12:54:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:54:54,102 INFO L470 AbstractCegarLoop]: Abstraction has 2558 states and 3740 transitions. [2021-11-06 12:54:54,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:54:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3740 transitions. [2021-11-06 12:54:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-06 12:54:54,105 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:54:54,105 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 12:54:54,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 12:54:54,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:54:54,306 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:54:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:54:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -855956460, now seen corresponding path program 1 times [2021-11-06 12:54:54,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:54:54,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272353957] [2021-11-06 12:54:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:54:54,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:54:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:54:54,561 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 12:54:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:54:54,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-06 12:54:54,843 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 12:54:54,844 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:54:54,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 12:54:54,847 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:54:54,850 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:54:54,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:54:54 BoogieIcfgContainer [2021-11-06 12:54:54,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:54:54,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:54:54,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:54:54,997 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:54:54,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:49:09" (3/4) ... [2021-11-06 12:54:54,999 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 12:54:55,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:54:55,001 INFO L168 Benchmark]: Toolchain (without parser) took 349522.49 ms. Allocated memory was 132.1 MB in the beginning and 876.6 MB in the end (delta: 744.5 MB). Free memory was 93.4 MB in the beginning and 444.7 MB in the end (delta: -351.2 MB). Peak memory consumption was 393.2 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,001 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 92.3 MB. Free memory is still 50.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:54:55,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1241.21 ms. Allocated memory is still 132.1 MB. Free memory was 93.1 MB in the beginning and 57.6 MB in the end (delta: 35.5 MB). Peak memory consumption was 61.8 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 207.81 ms. Allocated memory was 132.1 MB in the beginning and 224.4 MB in the end (delta: 92.3 MB). Free memory was 57.6 MB in the beginning and 155.0 MB in the end (delta: -97.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,002 INFO L168 Benchmark]: Boogie Preprocessor took 182.14 ms. Allocated memory is still 224.4 MB. Free memory was 155.0 MB in the beginning and 128.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,002 INFO L168 Benchmark]: RCFGBuilder took 2866.19 ms. Allocated memory was 224.4 MB in the beginning and 385.9 MB in the end (delta: 161.5 MB). Free memory was 128.8 MB in the beginning and 243.6 MB in the end (delta: -114.8 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,003 INFO L168 Benchmark]: TraceAbstraction took 345015.64 ms. Allocated memory was 385.9 MB in the beginning and 876.6 MB in the end (delta: 490.7 MB). Free memory was 243.6 MB in the beginning and 445.7 MB in the end (delta: -202.1 MB). Peak memory consumption was 594.8 MB. Max. memory is 16.1 GB. [2021-11-06 12:54:55,003 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 876.6 MB. Free memory was 445.7 MB in the beginning and 444.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:54:55,004 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.19 ms. Allocated memory is still 92.3 MB. Free memory is still 50.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1241.21 ms. Allocated memory is still 132.1 MB. Free memory was 93.1 MB in the beginning and 57.6 MB in the end (delta: 35.5 MB). Peak memory consumption was 61.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 207.81 ms. Allocated memory was 132.1 MB in the beginning and 224.4 MB in the end (delta: 92.3 MB). Free memory was 57.6 MB in the beginning and 155.0 MB in the end (delta: -97.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 182.14 ms. Allocated memory is still 224.4 MB. Free memory was 155.0 MB in the beginning and 128.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2866.19 ms. Allocated memory was 224.4 MB in the beginning and 385.9 MB in the end (delta: 161.5 MB). Free memory was 128.8 MB in the beginning and 243.6 MB in the end (delta: -114.8 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 345015.64 ms. Allocated memory was 385.9 MB in the beginning and 876.6 MB in the end (delta: 490.7 MB). Free memory was 243.6 MB in the beginning and 445.7 MB in the end (delta: -202.1 MB). Peak memory consumption was 594.8 MB. Max. memory is 16.1 GB. * Witness Printer took 3.24 ms. Allocated memory is still 876.6 MB. Free memory was 445.7 MB in the beginning and 444.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7129]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4873, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4871] void *tmp ; [L4862] void *tmp___2 ; [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] return ldv_malloc(size); [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7287] return __VERIFIER_nondet_int(); [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6753] return (status); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L6037] struct slip *sl ; [L6038] int err ; [L6039] int tmp ; [L6040] dev_t tmp___0 ; [L6041] struct task_struct *tmp___1 ; [L6042] int tmp___2 ; [L7172] return __VERIFIER_nondet_int(); [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] tmp = netdev_priv((struct net_device const *)dev) [L5939] sl = (struct slip *)tmp [L5940] EXPR sl->tty [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5940] EXPR sl->leased [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5940] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5949] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6057] EXPR tty->disc_data [L6057] sl = (struct slip *)tty->disc_data [L6058] err = -17 [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6059] EXPR sl->magic [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 [L7276] return __VERIFIER_nondet_uint(); [L6064] tmp___0 = tty_devnum(tty) [L5961] int i ; [L5962] struct net_device *dev ; [L5963] struct slip *sl ; [L5964] void *tmp ; [L5965] int tmp___0 ; [L5966] char name[16U] ; [L5967] void *tmp___1 ; [L5968] struct lock_class_key __key ; [L5969] struct lock_class_key __key___0 ; [L5970] struct lock_class_key __key___1 ; [L5972] dev = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5985] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6011] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6015] dev->base_addr = (unsigned long )i VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] tmp___1 = netdev_priv((struct net_device const *)dev) [L6019] sl = (struct slip *)tmp___1 [L6020] sl->magic = 21250 [L6021] sl->dev = dev [L4778] return (& lock->ldv_5934.rlock); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6024] sl->mode = 8U [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive [L6029] sl->outfill_timer.data = (unsigned long )sl [L6030] sl->outfill_timer.function = & sl_outfill [L6031] *(slip_devs + (unsigned long )i) = dev [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6065] sl = sl_alloc(tmp___0) [L6066] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6070] sl->tty = tty [L6071] tty->disc_data = (void *)sl [L7276] return __VERIFIER_nondet_uint(); [L6072] sl->line = tty_devnum(tty) [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] EXPR sl->keepalive VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6095] COND TRUE (unsigned int )sl->outfill != 0U [L6096] EXPR sl->outfill [L6096] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7135] COND FALSE !(ret_val <= 0) VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7129] reach_error() VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1042 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 344.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 334.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 61906 SDtfs, 196958 SDslu, 414845 SDs, 0 SdLazy, 49436 SolverSat, 1697 SolverUnsat, 79 SolverUnknown, 0 SolverNotchecked, 285.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 275 SyntacticMatches, 4 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23907 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2558occurred in iteration=19, InterpolantAutomatonStates: 472, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 81281 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1651 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 6697 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2700 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 20/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 12:54:55,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:54:56,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:54:56,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:54:56,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:54:56,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:54:56,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:54:56,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:54:56,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:54:56,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:54:56,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:54:56,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:54:56,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:54:56,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:54:56,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:54:56,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:54:56,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:54:56,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:54:56,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:54:56,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:54:56,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:54:56,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:54:56,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:54:56,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:54:56,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:54:56,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:54:56,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:54:56,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:54:56,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:54:56,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:54:56,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:54:56,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:54:56,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:54:56,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:54:56,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:54:56,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:54:56,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:54:56,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:54:56,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:54:56,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:54:56,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:54:56,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:54:56,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 12:54:56,894 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:54:56,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:54:56,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:54:56,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:54:56,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:54:56,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:54:56,897 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:54:56,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:54:56,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:54:56,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:54:56,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:54:56,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:54:56,899 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 12:54:56,899 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 12:54:56,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:54:56,900 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:54:56,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:54:56,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:54:56,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:54:56,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:54:56,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:54:56,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:54:56,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:54:56,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:54:56,901 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 12:54:56,901 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 12:54:56,902 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:54:56,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:54:56,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:54:56,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:54:56,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 12:54:56,903 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-06 12:54:57,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:54:57,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:54:57,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:54:57,200 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:54:57,200 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:54:57,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:54:57,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd970fb3d/6cc22222c1fa4e87b7550f1da4c62755/FLAG6d8dde55a [2021-11-06 12:54:57,770 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:54:57,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:54:57,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd970fb3d/6cc22222c1fa4e87b7550f1da4c62755/FLAG6d8dde55a [2021-11-06 12:54:58,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd970fb3d/6cc22222c1fa4e87b7550f1da4c62755 [2021-11-06 12:54:58,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:54:58,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:54:58,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:54:58,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:54:58,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:54:58,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:54:58" (1/1) ... [2021-11-06 12:54:58,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62abaea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:58, skipping insertion in model container [2021-11-06 12:54:58,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:54:58" (1/1) ... [2021-11-06 12:54:58,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:54:58,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:54:59,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-06 12:54:59,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:54:59,156 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:54:59,387 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-06 12:54:59,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:54:59,460 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:54:59,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59 WrapperNode [2021-11-06 12:54:59,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:54:59,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:54:59,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:54:59,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:54:59,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:54:59,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:54:59,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:54:59,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:54:59,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:54:59,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:54:59,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:54:59,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:54:59,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (1/1) ... [2021-11-06 12:54:59,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:54:59,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:54:59,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 12:54:59,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 12:55:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 12:55:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 12:55:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-06 12:55:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 12:55:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 12:55:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:55:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 12:55:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:55:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 12:55:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 12:55:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-06 12:55:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:55:00,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:55:10,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:55:10,753 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-06 12:55:10,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:55:10 BoogieIcfgContainer [2021-11-06 12:55:10,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:55:10,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:55:10,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:55:10,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:55:10,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:54:58" (1/3) ... [2021-11-06 12:55:10,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d807db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:55:10, skipping insertion in model container [2021-11-06 12:55:10,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:54:59" (2/3) ... [2021-11-06 12:55:10,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d807db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:55:10, skipping insertion in model container [2021-11-06 12:55:10,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:55:10" (3/3) ... [2021-11-06 12:55:10,761 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-06 12:55:10,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:55:10,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-06 12:55:10,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:55:10,799 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-11-06 12:55:10,799 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-06 12:55:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 12:55:10,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:10,832 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-11-06 12:55:10,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-06 12:55:10,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:10,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810329750] [2021-11-06 12:55:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:10,848 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:10,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:10,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:10,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 12:55:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:11,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:55:11,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:11,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:11,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:11,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810329750] [2021-11-06 12:55:11,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810329750] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:11,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:11,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-06 12:55:11,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750929754] [2021-11-06 12:55:11,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:55:11,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:55:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:55:11,522 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:11,643 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-06 12:55:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:55:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-11-06 12:55:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:11,661 INFO L225 Difference]: With dead ends: 2079 [2021-11-06 12:55:11,662 INFO L226 Difference]: Without dead ends: 1011 [2021-11-06 12:55:11,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:55:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-06 12:55:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-06 12:55:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-06 12:55:11,752 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-06 12:55:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:11,752 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-06 12:55:11,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-06 12:55:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 12:55:11,757 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:11,758 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-11-06 12:55:11,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:11,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:11,968 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-06 12:55:11,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:11,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270051006] [2021-11-06 12:55:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:11,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:11,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 12:55:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:12,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:55:12,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:12,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:12,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:12,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270051006] [2021-11-06 12:55:12,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270051006] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:12,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:12,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:55:12,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720001587] [2021-11-06 12:55:12,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:55:12,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:55:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:55:12,512 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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-11-06 12:55:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:12,562 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-06 12:55:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:55:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 36 [2021-11-06 12:55:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:12,566 INFO L225 Difference]: With dead ends: 1999 [2021-11-06 12:55:12,566 INFO L226 Difference]: Without dead ends: 1011 [2021-11-06 12:55:12,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:55:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-06 12:55:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-06 12:55:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-06 12:55:12,587 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-06 12:55:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:12,588 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-06 12:55:12,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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-11-06 12:55:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-06 12:55:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 12:55:12,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:12,589 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-11-06 12:55:12,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:12,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:12,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-06 12:55:12,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:12,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881995794] [2021-11-06 12:55:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:12,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:12,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:12,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 12:55:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:13,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 12:55:13,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:13,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:13,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:13,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881995794] [2021-11-06 12:55:13,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881995794] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:13,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:13,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-06 12:55:13,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064233310] [2021-11-06 12:55:13,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 12:55:13,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 12:55:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-06 12:55:13,555 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:16,561 INFO L93 Difference]: Finished difference Result 8366 states and 12465 transitions. [2021-11-06 12:55:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 12:55:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 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-11-06 12:55:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:16,585 INFO L225 Difference]: With dead ends: 8366 [2021-11-06 12:55:16,586 INFO L226 Difference]: Without dead ends: 7370 [2021-11-06 12:55:16,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-06 12:55:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2021-11-06 12:55:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 1972. [2021-11-06 12:55:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4814814814814814) internal successors, (2920), 1971 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2920 transitions. [2021-11-06 12:55:16,688 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2920 transitions. Word has length 39 [2021-11-06 12:55:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:16,688 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2920 transitions. [2021-11-06 12:55:16,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2920 transitions. [2021-11-06 12:55:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:55:16,690 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:16,690 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-11-06 12:55:16,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:16,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:16,904 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash 713639092, now seen corresponding path program 1 times [2021-11-06 12:55:16,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:16,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960580084] [2021-11-06 12:55:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:16,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:16,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:16,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 12:55:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:17,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 12:55:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:17,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:17,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:17,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960580084] [2021-11-06 12:55:17,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960580084] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:17,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:17,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:55:17,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268736429] [2021-11-06 12:55:17,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:55:17,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:55:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:55:17,452 INFO L87 Difference]: Start difference. First operand 1972 states and 2920 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:17,804 INFO L93 Difference]: Finished difference Result 6659 states and 9888 transitions. [2021-11-06 12:55:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 12:55:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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-11-06 12:55:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:17,825 INFO L225 Difference]: With dead ends: 6659 [2021-11-06 12:55:17,826 INFO L226 Difference]: Without dead ends: 6657 [2021-11-06 12:55:17,828 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:55:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6657 states. [2021-11-06 12:55:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6657 to 1976. [2021-11-06 12:55:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.480506329113924) internal successors, (2924), 1975 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2924 transitions. [2021-11-06 12:55:17,947 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2924 transitions. Word has length 42 [2021-11-06 12:55:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:17,948 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 2924 transitions. [2021-11-06 12:55:17,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2924 transitions. [2021-11-06 12:55:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 12:55:17,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:17,950 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] [2021-11-06 12:55:17,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:18,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:18,161 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1808756799, now seen corresponding path program 1 times [2021-11-06 12:55:18,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:18,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691606363] [2021-11-06 12:55:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:18,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:18,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:18,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:18,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 12:55:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:18,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:55:18,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:18,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:18,837 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:18,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691606363] [2021-11-06 12:55:18,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691606363] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:18,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:18,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 12:55:18,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14776427] [2021-11-06 12:55:18,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:55:18,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:55:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:55:18,839 INFO L87 Difference]: Start difference. First operand 1976 states and 2924 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:23,246 INFO L93 Difference]: Finished difference Result 7813 states and 11591 transitions. [2021-11-06 12:55:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:55:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 12:55:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:23,270 INFO L225 Difference]: With dead ends: 7813 [2021-11-06 12:55:23,271 INFO L226 Difference]: Without dead ends: 5862 [2021-11-06 12:55:23,276 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:55:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2021-11-06 12:55:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 1996. [2021-11-06 12:55:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.4796992481203008) internal successors, (2952), 1995 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2952 transitions. [2021-11-06 12:55:23,431 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2952 transitions. Word has length 49 [2021-11-06 12:55:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:23,431 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 2952 transitions. [2021-11-06 12:55:23,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2952 transitions. [2021-11-06 12:55:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:55:23,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:23,433 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] [2021-11-06 12:55:23,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:23,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:23,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 287427040, now seen corresponding path program 1 times [2021-11-06 12:55:23,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:23,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162811711] [2021-11-06 12:55:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:23,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:23,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 12:55:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:24,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:55:24,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:24,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:24,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:24,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162811711] [2021-11-06 12:55:24,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162811711] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:24,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:24,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:55:24,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6091119] [2021-11-06 12:55:24,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:55:24,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:55:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:55:24,284 INFO L87 Difference]: Start difference. First operand 1996 states and 2952 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-11-06 12:55:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:25,077 INFO L93 Difference]: Finished difference Result 9962 states and 14800 transitions. [2021-11-06 12:55:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 12:55:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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 51 [2021-11-06 12:55:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:25,105 INFO L225 Difference]: With dead ends: 9962 [2021-11-06 12:55:25,105 INFO L226 Difference]: Without dead ends: 9960 [2021-11-06 12:55:25,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-06 12:55:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2021-11-06 12:55:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 1998. [2021-11-06 12:55:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 1.4792188282423635) internal successors, (2954), 1997 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2954 transitions. [2021-11-06 12:55:25,281 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2954 transitions. Word has length 51 [2021-11-06 12:55:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:25,283 INFO L470 AbstractCegarLoop]: Abstraction has 1998 states and 2954 transitions. [2021-11-06 12:55:25,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-11-06 12:55:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2954 transitions. [2021-11-06 12:55:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 12:55:25,289 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:25,289 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:25,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:25,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:25,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -755149405, now seen corresponding path program 1 times [2021-11-06 12:55:25,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:25,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483359825] [2021-11-06 12:55:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:25,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:25,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:25,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 12:55:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:25,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:55:25,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:26,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:26,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:26,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483359825] [2021-11-06 12:55:26,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483359825] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:26,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:26,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 12:55:26,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985298799] [2021-11-06 12:55:26,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:55:26,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:55:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:55:26,377 INFO L87 Difference]: Start difference. First operand 1998 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:28,684 INFO L93 Difference]: Finished difference Result 2000 states and 2955 transitions. [2021-11-06 12:55:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:55:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-11-06 12:55:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:28,696 INFO L225 Difference]: With dead ends: 2000 [2021-11-06 12:55:28,696 INFO L226 Difference]: Without dead ends: 1024 [2021-11-06 12:55:28,697 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-11-06 12:55:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-06 12:55:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2021-11-06 12:55:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4721407624633431) internal successors, (1506), 1023 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1506 transitions. [2021-11-06 12:55:28,760 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1506 transitions. Word has length 65 [2021-11-06 12:55:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:28,762 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1506 transitions. [2021-11-06 12:55:28,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1506 transitions. [2021-11-06 12:55:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 12:55:28,764 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:28,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:28,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:28,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:28,977 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash -436055095, now seen corresponding path program 1 times [2021-11-06 12:55:28,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:28,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575827719] [2021-11-06 12:55:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:28,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:28,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:28,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:28,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 12:55:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:29,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:55:29,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:29,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:29,921 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:29,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575827719] [2021-11-06 12:55:29,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575827719] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:29,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:29,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 12:55:29,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747146485] [2021-11-06 12:55:29,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:55:29,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:55:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:55:29,924 INFO L87 Difference]: Start difference. First operand 1024 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:32,374 INFO L93 Difference]: Finished difference Result 3998 states and 5914 transitions. [2021-11-06 12:55:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:55:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 12:55:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:32,383 INFO L225 Difference]: With dead ends: 3998 [2021-11-06 12:55:32,383 INFO L226 Difference]: Without dead ends: 2999 [2021-11-06 12:55:32,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:55:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2021-11-06 12:55:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1029. [2021-11-06 12:55:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.4708171206225682) internal successors, (1512), 1028 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1512 transitions. [2021-11-06 12:55:32,480 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1512 transitions. Word has length 67 [2021-11-06 12:55:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:32,480 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1512 transitions. [2021-11-06 12:55:32,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1512 transitions. [2021-11-06 12:55:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 12:55:32,482 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:32,482 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:32,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:32,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:32,698 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash 973079369, now seen corresponding path program 1 times [2021-11-06 12:55:32,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:32,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260098085] [2021-11-06 12:55:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:32,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:32,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:32,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:32,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 12:55:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:33,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 12:55:33,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:33,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:33,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:33,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260098085] [2021-11-06 12:55:33,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260098085] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 12:55:33,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:55:33,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-11-06 12:55:33,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949663335] [2021-11-06 12:55:33,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 12:55:33,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 12:55:33,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:55:33,725 INFO L87 Difference]: Start difference. First operand 1029 states and 1512 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:43,088 INFO L93 Difference]: Finished difference Result 7995 states and 11824 transitions. [2021-11-06 12:55:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:55:43,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 12:55:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:43,100 INFO L225 Difference]: With dead ends: 7995 [2021-11-06 12:55:43,100 INFO L226 Difference]: Without dead ends: 6991 [2021-11-06 12:55:43,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-06 12:55:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2021-11-06 12:55:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 1041. [2021-11-06 12:55:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1040 states have (on average 1.4692307692307693) internal successors, (1528), 1040 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1528 transitions. [2021-11-06 12:55:43,221 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1528 transitions. Word has length 73 [2021-11-06 12:55:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:43,222 INFO L470 AbstractCegarLoop]: Abstraction has 1041 states and 1528 transitions. [2021-11-06 12:55:43,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1528 transitions. [2021-11-06 12:55:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 12:55:43,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:43,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:43,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:43,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:43,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash 152916243, now seen corresponding path program 1 times [2021-11-06 12:55:43,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:43,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026212300] [2021-11-06 12:55:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:43,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:43,434 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:43,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 12:55:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:44,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 12:55:44,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:44,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:44,370 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:44,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026212300] [2021-11-06 12:55:44,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026212300] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:44,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:44,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:55:44,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482760124] [2021-11-06 12:55:44,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:55:44,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:44,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:55:44,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:55:44,372 INFO L87 Difference]: Start difference. First operand 1041 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:45,052 INFO L93 Difference]: Finished difference Result 4513 states and 6690 transitions. [2021-11-06 12:55:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:55:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-06 12:55:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:45,060 INFO L225 Difference]: With dead ends: 4513 [2021-11-06 12:55:45,060 INFO L226 Difference]: Without dead ends: 3497 [2021-11-06 12:55:45,062 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:55:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-11-06 12:55:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 1043. [2021-11-06 12:55:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1042 states have (on average 1.4683301343570057) internal successors, (1530), 1042 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1530 transitions. [2021-11-06 12:55:45,177 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1530 transitions. Word has length 75 [2021-11-06 12:55:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:45,178 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 1530 transitions. [2021-11-06 12:55:45,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1530 transitions. [2021-11-06 12:55:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 12:55:45,180 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:45,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:45,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:45,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:45,396 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash 800611437, now seen corresponding path program 1 times [2021-11-06 12:55:45,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:45,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978209751] [2021-11-06 12:55:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:45,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:45,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:45,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 12:55:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:46,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:55:46,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:46,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:46,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:46,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978209751] [2021-11-06 12:55:46,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978209751] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:46,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:46,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 12:55:46,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282279654] [2021-11-06 12:55:46,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:55:46,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:55:46,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:55:46,251 INFO L87 Difference]: Start difference. First operand 1043 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:46,617 INFO L93 Difference]: Finished difference Result 2901 states and 4285 transitions. [2021-11-06 12:55:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:55:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-06 12:55:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:46,622 INFO L225 Difference]: With dead ends: 2901 [2021-11-06 12:55:46,622 INFO L226 Difference]: Without dead ends: 1883 [2021-11-06 12:55:46,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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-11-06 12:55:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-11-06 12:55:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1045. [2021-11-06 12:55:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4674329501915708) internal successors, (1532), 1044 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1532 transitions. [2021-11-06 12:55:46,729 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1532 transitions. Word has length 77 [2021-11-06 12:55:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:46,730 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1532 transitions. [2021-11-06 12:55:46,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1532 transitions. [2021-11-06 12:55:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 12:55:46,731 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:46,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:55:46,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:46,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:46,943 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1856276453, now seen corresponding path program 1 times [2021-11-06 12:55:46,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:46,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979634299] [2021-11-06 12:55:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:46,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:46,945 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:46,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 12:55:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:47,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:55:47,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:47,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:47,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:47,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979634299] [2021-11-06 12:55:47,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979634299] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:47,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:47,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:55:47,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228775806] [2021-11-06 12:55:47,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:55:47,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:55:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:55:47,983 INFO L87 Difference]: Start difference. First operand 1045 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:50,036 INFO L93 Difference]: Finished difference Result 8360 states and 12395 transitions. [2021-11-06 12:55:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 12:55:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 81 [2021-11-06 12:55:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:50,048 INFO L225 Difference]: With dead ends: 8360 [2021-11-06 12:55:50,048 INFO L226 Difference]: Without dead ends: 7340 [2021-11-06 12:55:50,050 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-06 12:55:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7340 states. [2021-11-06 12:55:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7340 to 1048. [2021-11-06 12:55:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.466093600764088) internal successors, (1535), 1047 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1535 transitions. [2021-11-06 12:55:50,202 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1535 transitions. Word has length 81 [2021-11-06 12:55:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:50,202 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1535 transitions. [2021-11-06 12:55:50,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1535 transitions. [2021-11-06 12:55:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 12:55:50,204 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:50,204 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, 1, 1, 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-11-06 12:55:50,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:50,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:50,421 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1754920992, now seen corresponding path program 1 times [2021-11-06 12:55:50,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:50,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089232707] [2021-11-06 12:55:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:50,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:50,423 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:50,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 12:55:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:51,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:55:51,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:51,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:55:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:55:51,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:55:51,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089232707] [2021-11-06 12:55:51,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089232707] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:55:51,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:55:51,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 12:55:51,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517814910] [2021-11-06 12:55:51,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:55:51,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:55:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:55:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:55:51,390 INFO L87 Difference]: Start difference. First operand 1048 states and 1535 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:55:51,594 INFO L93 Difference]: Finished difference Result 2080 states and 3052 transitions. [2021-11-06 12:55:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:55:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-06 12:55:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:55:51,596 INFO L225 Difference]: With dead ends: 2080 [2021-11-06 12:55:51,596 INFO L226 Difference]: Without dead ends: 1057 [2021-11-06 12:55:51,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 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-11-06 12:55:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-11-06 12:55:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1048. [2021-11-06 12:55:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.440305635148042) internal successors, (1508), 1047 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1508 transitions. [2021-11-06 12:55:51,697 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1508 transitions. Word has length 84 [2021-11-06 12:55:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:55:51,697 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1508 transitions. [2021-11-06 12:55:51,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:55:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1508 transitions. [2021-11-06 12:55:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 12:55:51,699 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:55:51,699 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, 1, 1, 1, 1, 1, 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-11-06 12:55:51,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 12:55:51,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:55:51,903 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 12:55:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:55:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-06 12:55:51,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:55:51,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418409047] [2021-11-06 12:55:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:55:51,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:55:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:55:51,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:55:51,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 12:55:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:55:55,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-06 12:55:55,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:55:55,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 12:55:56,429 INFO L354 Elim1Store]: treesize reduction 158, result has 18.1 percent of original size [2021-11-06 12:55:56,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 66 [2021-11-06 12:55:57,086 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-06 12:55:57,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 51 [2021-11-06 12:55:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:57,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-06 12:55:57,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2021-11-06 12:55:58,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2021-11-06 12:55:58,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:55:58,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:55:58,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2021-11-06 12:55:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-06 12:55:58,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:58,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-06 12:55:59,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 12:55:59,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-06 12:55:59,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 12:55:59,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-06 12:55:59,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 22 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2021-11-06 12:55:59,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 312 [2021-11-06 12:55:59,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 295 [2021-11-06 12:55:59,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:55:59,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 295 [2021-11-06 12:56:00,179 INFO L354 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2021-11-06 12:56:00,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 271 treesize of output 271 [2021-11-06 12:56:00,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 248 [2021-11-06 12:56:00,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 223 [2021-11-06 12:56:00,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,695 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-06 12:56:00,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 228 [2021-11-06 12:56:00,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:00,888 INFO L354 Elim1Store]: treesize reduction 435, result has 16.5 percent of original size [2021-11-06 12:56:00,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 236 treesize of output 210 [2021-11-06 12:56:03,345 INFO L354 Elim1Store]: treesize reduction 376, result has 10.3 percent of original size [2021-11-06 12:56:03,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 474 treesize of output 300 [2021-11-06 12:56:03,745 INFO L354 Elim1Store]: treesize reduction 352, result has 10.9 percent of original size [2021-11-06 12:56:03,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 245 treesize of output 242 [2021-11-06 12:56:04,030 INFO L354 Elim1Store]: treesize reduction 208, result has 21.5 percent of original size [2021-11-06 12:56:04,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 230 treesize of output 235 [2021-11-06 12:56:04,447 INFO L354 Elim1Store]: treesize reduction 272, result has 17.3 percent of original size [2021-11-06 12:56:04,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 211 treesize of output 216 [2021-11-06 12:56:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,875 INFO L354 Elim1Store]: treesize reduction 236, result has 8.5 percent of original size [2021-11-06 12:56:05,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 154 treesize of output 153 [2021-11-06 12:56:05,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:05,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,013 INFO L354 Elim1Store]: treesize reduction 236, result has 8.5 percent of original size [2021-11-06 12:56:06,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 135 treesize of output 134 [2021-11-06 12:56:06,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:06,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 107 [2021-11-06 12:56:08,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,220 INFO L354 Elim1Store]: treesize reduction 236, result has 8.5 percent of original size [2021-11-06 12:56:08,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 154 treesize of output 153 [2021-11-06 12:56:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,319 INFO L354 Elim1Store]: treesize reduction 236, result has 8.5 percent of original size [2021-11-06 12:56:08,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 135 treesize of output 134 [2021-11-06 12:56:08,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:08,583 INFO L354 Elim1Store]: treesize reduction 147, result has 5.8 percent of original size [2021-11-06 12:56:08,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 116 [2021-11-06 12:56:11,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,529 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 12:56:11,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 55 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 141 [2021-11-06 12:56:11,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,830 INFO L354 Elim1Store]: treesize reduction 348, result has 5.9 percent of original size [2021-11-06 12:56:11,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 176 treesize of output 164 [2021-11-06 12:56:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:56:12,051 INFO L354 Elim1Store]: treesize reduction 348, result has 5.9 percent of original size [2021-11-06 12:56:12,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 146 treesize of output 134 [2021-11-06 12:56:23,791 INFO L354 Elim1Store]: treesize reduction 360, result has 12.2 percent of original size [2021-11-06 12:56:23,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 498 treesize of output 314 [2021-11-06 12:56:23,874 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-06 12:56:23,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 748 treesize of output 279 [2021-11-06 12:56:24,325 INFO L354 Elim1Store]: treesize reduction 322, result has 2.1 percent of original size [2021-11-06 12:56:24,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 55 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 388 treesize of output 306 [2021-11-06 12:56:24,753 INFO L354 Elim1Store]: treesize reduction 320, result has 13.0 percent of original size [2021-11-06 12:56:24,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 245 treesize of output 233 [2021-11-06 12:56:24,805 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-06 12:56:24,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 144 [2021-11-06 12:56:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:56:25,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:57:00,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse12 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base (let ((.cse15 (let ((.cse17 (store (select .cse14 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv190 64))))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.base))))) (store .cse20 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse20 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.offset))))) (store .cse4 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse4 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-06 12:57:06,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse6 (bvadd (_ bv186 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse7 (bvadd (_ bv208 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse8 (bvadd (_ bv212 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse12 (bvadd |c_ULTIMATE.start_sl_alloc_#res.offset| (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| (let ((.cse15 (let ((.cse17 (store (select .cse14 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd (_ bv190 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.base|))))) (store .cse20 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse20 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.offset|))))) (store .cse4 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (concat (select .cse0 (bvadd .cse1 (_ bv116 64))) (select .cse0 (bvadd .cse1 (_ bv112 64))))))) (_ bv0 32))) is different from false [2021-11-06 12:57:40,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-06 12:57:42,878 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-06 12:58:30,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-06 12:58:32,572 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-06 12:59:02,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-06 12:59:04,615 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true