./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:50:19,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:50:19,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:50:19,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:50:19,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:50:19,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:50:19,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:50:19,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:50:19,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:50:19,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:50:19,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:50:19,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:50:19,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:50:19,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:50:19,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:50:19,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:50:19,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:50:19,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:50:19,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:50:19,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:50:19,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:50:19,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:50:19,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:50:19,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:50:19,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:50:19,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:50:19,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:50:19,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:50:19,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:50:19,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:50:19,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:50:19,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:50:19,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:50:19,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:50:19,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:50:19,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:50:19,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:50:19,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:50:19,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:50:19,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:50:19,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:50:19,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 00:50:19,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:50:19,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:50:19,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:50:19,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:50:19,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:50:19,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:50:19,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:50:19,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:50:19,689 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:50:19,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:50:19,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:50:19,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:50:19,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:50:19,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:50:19,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:50:19,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:50:19,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:50:19,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:50:19,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:50:19,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:50:19,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:50:19,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:50:19,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:50:19,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:50:19,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:50:19,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:50:19,693 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2021-11-17 00:50:19,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:50:19,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:50:19,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:50:19,903 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:50:19,906 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:50:19,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:50:19,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb0112d/f36f8eb3e9124cedbd71ec40826e4a91/FLAGd91a000d7 [2021-11-17 00:50:20,507 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:50:20,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:50:20,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb0112d/f36f8eb3e9124cedbd71ec40826e4a91/FLAGd91a000d7 [2021-11-17 00:50:20,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb0112d/f36f8eb3e9124cedbd71ec40826e4a91 [2021-11-17 00:50:20,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:50:20,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:50:20,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:50:20,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:50:20,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:50:20,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:50:20" (1/1) ... [2021-11-17 00:50:20,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cc738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:20, skipping insertion in model container [2021-11-17 00:50:20,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:50:20" (1/1) ... [2021-11-17 00:50:20,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:50:20,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:50:21,487 WARN L230 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2021-11-17 00:50:21,774 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:50:21,786 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:50:21,863 WARN L230 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2021-11-17 00:50:22,006 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:50:22,045 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:50:22,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22 WrapperNode [2021-11-17 00:50:22,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:50:22,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:50:22,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:50:22,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:50:22,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,170 INFO L137 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2360 [2021-11-17 00:50:22,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:50:22,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:50:22,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:50:22,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:50:22,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:50:22,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:50:22,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:50:22,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:50:22,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (1/1) ... [2021-11-17 00:50:22,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:50:22,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:50:22,301 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-17 00:50:22,326 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-17 00:50:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-11-17 00:50:22,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-11-17 00:50:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 00:50:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2021-11-17 00:50:22,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2021-11-17 00:50:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2021-11-17 00:50:22,337 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2021-11-17 00:50:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:50:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:50:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:50:22,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:50:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:50:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2021-11-17 00:50:22,338 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2021-11-17 00:50:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2021-11-17 00:50:22,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2021-11-17 00:50:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2021-11-17 00:50:22,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2021-11-17 00:50:22,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:50:22,339 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:50:22,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2021-11-17 00:50:22,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2021-11-17 00:50:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:50:22,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:50:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2021-11-17 00:50:22,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2021-11-17 00:50:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-17 00:50:22,340 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-17 00:50:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2021-11-17 00:50:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2021-11-17 00:50:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2021-11-17 00:50:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2021-11-17 00:50:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:50:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:50:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:50:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:50:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:50:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:50:22,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:50:22,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 00:50:22,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 00:50:22,342 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-11-17 00:50:22,342 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-11-17 00:50:22,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:50:22,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:50:22,343 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2021-11-17 00:50:22,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2021-11-17 00:50:22,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:50:22,343 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2021-11-17 00:50:22,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2021-11-17 00:50:22,343 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2021-11-17 00:50:22,343 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2021-11-17 00:50:22,343 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-11-17 00:50:22,344 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-11-17 00:50:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:50:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:50:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:50:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 00:50:22,344 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 00:50:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2021-11-17 00:50:22,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2021-11-17 00:50:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2021-11-17 00:50:22,345 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2021-11-17 00:50:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:50:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-11-17 00:50:22,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-11-17 00:50:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-11-17 00:50:22,345 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-11-17 00:50:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:50:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:50:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 00:50:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 00:50:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-11-17 00:50:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-11-17 00:50:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2021-11-17 00:50:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2021-11-17 00:50:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:50:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-17 00:50:22,347 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-17 00:50:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 00:50:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:50:22,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:50:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 00:50:22,347 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 00:50:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:50:22,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:50:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2021-11-17 00:50:22,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2021-11-17 00:50:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-17 00:50:22,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-17 00:50:22,659 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:50:22,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:50:23,022 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:50:25,975 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:50:25,983 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:50:25,983 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-17 00:50:25,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:50:25 BoogieIcfgContainer [2021-11-17 00:50:25,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:50:25,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:50:25,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:50:25,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:50:25,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:50:20" (1/3) ... [2021-11-17 00:50:25,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce487ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:50:25, skipping insertion in model container [2021-11-17 00:50:25,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:50:22" (2/3) ... [2021-11-17 00:50:25,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce487ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:50:25, skipping insertion in model container [2021-11-17 00:50:25,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:50:25" (3/3) ... [2021-11-17 00:50:25,990 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:50:25,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:50:25,994 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:50:26,054 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:50:26,058 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-17 00:50:26,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:50:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 569 states have (on average 1.437609841827768) internal successors, (818), 583 states have internal predecessors, (818), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2021-11-17 00:50:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-17 00:50:26,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:26,085 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:26,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 678107625, now seen corresponding path program 1 times [2021-11-17 00:50:26,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:26,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943279026] [2021-11-17 00:50:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:26,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:50:26,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:26,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943279026] [2021-11-17 00:50:26,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943279026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:26,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:26,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 00:50:26,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393288143] [2021-11-17 00:50:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:26,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:50:26,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:26,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:50:26,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:50:26,471 INFO L87 Difference]: Start difference. First operand has 723 states, 569 states have (on average 1.437609841827768) internal successors, (818), 583 states have internal predecessors, (818), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:50:29,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:50:29,885 INFO L93 Difference]: Finished difference Result 2286 states and 3408 transitions. [2021-11-17 00:50:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:50:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2021-11-17 00:50:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:50:29,901 INFO L225 Difference]: With dead ends: 2286 [2021-11-17 00:50:29,902 INFO L226 Difference]: Without dead ends: 1552 [2021-11-17 00:50:29,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-17 00:50:29,910 INFO L933 BasicCegarLoop]: 1106 mSDtfsCounter, 1440 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 308 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:50:29,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 2306 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 789 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2021-11-17 00:50:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2021-11-17 00:50:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1380. [2021-11-17 00:50:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1098 states have (on average 1.424408014571949) internal successors, (1564), 1114 states have internal predecessors, (1564), 211 states have call successors, (211), 71 states have call predecessors, (211), 70 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2021-11-17 00:50:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1985 transitions. [2021-11-17 00:50:30,018 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1985 transitions. Word has length 78 [2021-11-17 00:50:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:50:30,019 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 1985 transitions. [2021-11-17 00:50:30,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:50:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1985 transitions. [2021-11-17 00:50:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-17 00:50:30,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:30,029 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:30,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:50:30,029 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1376133839, now seen corresponding path program 1 times [2021-11-17 00:50:30,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:30,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971519943] [2021-11-17 00:50:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:30,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:50:30,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:30,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971519943] [2021-11-17 00:50:30,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971519943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:30,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:30,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:50:30,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125236533] [2021-11-17 00:50:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:30,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:50:30,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:50:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:50:30,164 INFO L87 Difference]: Start difference. First operand 1380 states and 1985 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:50:33,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:50:33,749 INFO L93 Difference]: Finished difference Result 4425 states and 6457 transitions. [2021-11-17 00:50:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:50:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2021-11-17 00:50:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:50:33,766 INFO L225 Difference]: With dead ends: 4425 [2021-11-17 00:50:33,767 INFO L226 Difference]: Without dead ends: 3063 [2021-11-17 00:50:33,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:50:33,774 INFO L933 BasicCegarLoop]: 1097 mSDtfsCounter, 1460 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 312 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:50:33,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 4035 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1399 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2021-11-17 00:50:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2021-11-17 00:50:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2799. [2021-11-17 00:50:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2229 states have (on average 1.4262000897263347) internal successors, (3179), 2267 states have internal predecessors, (3179), 421 states have call successors, (421), 141 states have call predecessors, (421), 148 states have return successors, (464), 422 states have call predecessors, (464), 420 states have call successors, (464) [2021-11-17 00:50:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 4064 transitions. [2021-11-17 00:50:33,928 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 4064 transitions. Word has length 82 [2021-11-17 00:50:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:50:33,929 INFO L470 AbstractCegarLoop]: Abstraction has 2799 states and 4064 transitions. [2021-11-17 00:50:33,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:50:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 4064 transitions. [2021-11-17 00:50:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 00:50:33,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:33,936 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:33,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:50:33,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2115293044, now seen corresponding path program 1 times [2021-11-17 00:50:33,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:33,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454298751] [2021-11-17 00:50:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:33,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 00:50:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 00:50:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:50:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 00:50:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-17 00:50:34,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:34,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454298751] [2021-11-17 00:50:34,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454298751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:34,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:34,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:50:34,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902312270] [2021-11-17 00:50:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:34,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:50:34,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:34,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:50:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:50:34,146 INFO L87 Difference]: Start difference. First operand 2799 states and 4064 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:50:37,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:39,711 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:50:39,876 INFO L93 Difference]: Finished difference Result 7425 states and 10855 transitions. [2021-11-17 00:50:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:50:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2021-11-17 00:50:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:50:39,895 INFO L225 Difference]: With dead ends: 7425 [2021-11-17 00:50:39,896 INFO L226 Difference]: Without dead ends: 4650 [2021-11-17 00:50:39,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:50:39,905 INFO L933 BasicCegarLoop]: 976 mSDtfsCounter, 1955 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 767 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:50:39,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2027 Valid, 2422 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 1292 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2021-11-17 00:50:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2021-11-17 00:50:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4161. [2021-11-17 00:50:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 3313 states have (on average 1.43284032598853) internal successors, (4747), 3367 states have internal predecessors, (4747), 613 states have call successors, (613), 213 states have call predecessors, (613), 234 states have return successors, (696), 618 states have call predecessors, (696), 612 states have call successors, (696) [2021-11-17 00:50:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 6056 transitions. [2021-11-17 00:50:40,028 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 6056 transitions. Word has length 140 [2021-11-17 00:50:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:50:40,030 INFO L470 AbstractCegarLoop]: Abstraction has 4161 states and 6056 transitions. [2021-11-17 00:50:40,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 00:50:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 6056 transitions. [2021-11-17 00:50:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 00:50:40,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:40,036 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:40,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:50:40,037 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 840633849, now seen corresponding path program 1 times [2021-11-17 00:50:40,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:40,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508521244] [2021-11-17 00:50:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:40,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 00:50:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 00:50:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 00:50:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 00:50:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 00:50:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:50:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 00:50:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:50:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:50:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-17 00:50:40,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:40,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508521244] [2021-11-17 00:50:40,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508521244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:40,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:40,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:50:40,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939770806] [2021-11-17 00:50:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:40,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:50:40,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:50:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:50:40,222 INFO L87 Difference]: Start difference. First operand 4161 states and 6056 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:50:43,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:45,663 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:47,732 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:49,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:50:49,994 INFO L93 Difference]: Finished difference Result 10882 states and 15769 transitions. [2021-11-17 00:50:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:50:49,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 169 [2021-11-17 00:50:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:50:50,023 INFO L225 Difference]: With dead ends: 10882 [2021-11-17 00:50:50,024 INFO L226 Difference]: Without dead ends: 6745 [2021-11-17 00:50:50,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:50:50,040 INFO L933 BasicCegarLoop]: 1467 mSDtfsCounter, 1247 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 370 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 3422 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:50:50,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1302 Valid, 3422 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1341 Invalid, 4 Unknown, 0 Unchecked, 9.6s Time] [2021-11-17 00:50:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2021-11-17 00:50:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 6110. [2021-11-17 00:50:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6110 states, 4891 states have (on average 1.418523819259865) internal successors, (6938), 4975 states have internal predecessors, (6938), 848 states have call successors, (848), 335 states have call predecessors, (848), 370 states have return successors, (977), 859 states have call predecessors, (977), 847 states have call successors, (977) [2021-11-17 00:50:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 8763 transitions. [2021-11-17 00:50:50,249 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 8763 transitions. Word has length 169 [2021-11-17 00:50:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:50:50,249 INFO L470 AbstractCegarLoop]: Abstraction has 6110 states and 8763 transitions. [2021-11-17 00:50:50,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:50:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 8763 transitions. [2021-11-17 00:50:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 00:50:50,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:50,258 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:50,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:50:50,258 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1912369058, now seen corresponding path program 1 times [2021-11-17 00:50:50,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:50,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745037068] [2021-11-17 00:50:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:50,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:50:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:50:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-17 00:50:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 00:50:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:50:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 00:50:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2021-11-17 00:50:50,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:50,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745037068] [2021-11-17 00:50:50,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745037068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:50,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:50,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:50:50,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074536670] [2021-11-17 00:50:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:50,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:50:50,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:50,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:50:50,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:50:50,432 INFO L87 Difference]: Start difference. First operand 6110 states and 8763 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:50:54,259 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:56,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:50:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:50:56,375 INFO L93 Difference]: Finished difference Result 15870 states and 22783 transitions. [2021-11-17 00:50:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:50:56,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2021-11-17 00:50:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:50:56,413 INFO L225 Difference]: With dead ends: 15870 [2021-11-17 00:50:56,414 INFO L226 Difference]: Without dead ends: 9795 [2021-11-17 00:50:56,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:50:56,432 INFO L933 BasicCegarLoop]: 991 mSDtfsCounter, 2851 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 1134 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2926 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1134 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:50:56,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2926 Valid, 2436 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1134 Valid, 1395 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2021-11-17 00:50:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2021-11-17 00:50:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8838. [2021-11-17 00:50:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 7071 states have (on average 1.410550134351577) internal successors, (9974), 7191 states have internal predecessors, (9974), 1184 states have call successors, (1184), 525 states have call predecessors, (1184), 582 states have return successors, (1368), 1201 states have call predecessors, (1368), 1183 states have call successors, (1368) [2021-11-17 00:50:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12526 transitions. [2021-11-17 00:50:56,711 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12526 transitions. Word has length 163 [2021-11-17 00:50:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:50:56,712 INFO L470 AbstractCegarLoop]: Abstraction has 8838 states and 12526 transitions. [2021-11-17 00:50:56,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:50:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12526 transitions. [2021-11-17 00:50:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 00:50:56,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:50:56,723 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:50:56,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:50:56,723 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:50:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:50:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1253354754, now seen corresponding path program 1 times [2021-11-17 00:50:56,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:50:56,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653341143] [2021-11-17 00:50:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:50:56,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:50:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:50:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:50:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:50:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:50:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:50:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:50:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:50:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:50:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:50:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:50:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:50:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 00:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 00:50:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:50:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:50:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:50:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 00:50:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:50:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-11-17 00:50:56,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:50:56,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653341143] [2021-11-17 00:50:56,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653341143] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:50:56,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:50:56,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:50:56,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846527226] [2021-11-17 00:50:56,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:50:56,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:50:56,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:50:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:50:56,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:50:56,923 INFO L87 Difference]: Start difference. First operand 8838 states and 12526 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 00:51:00,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:02,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:04,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:04,451 INFO L93 Difference]: Finished difference Result 14382 states and 20629 transitions. [2021-11-17 00:51:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:51:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2021-11-17 00:51:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:04,486 INFO L225 Difference]: With dead ends: 14382 [2021-11-17 00:51:04,487 INFO L226 Difference]: Without dead ends: 9802 [2021-11-17 00:51:04,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:51:04,503 INFO L933 BasicCegarLoop]: 935 mSDtfsCounter, 918 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 450 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:04,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [952 Valid, 2818 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1252 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2021-11-17 00:51:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2021-11-17 00:51:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8858. [2021-11-17 00:51:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7091 states have (on average 1.4093921872796502) internal successors, (9994), 7211 states have internal predecessors, (9994), 1184 states have call successors, (1184), 525 states have call predecessors, (1184), 582 states have return successors, (1368), 1201 states have call predecessors, (1368), 1183 states have call successors, (1368) [2021-11-17 00:51:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 12546 transitions. [2021-11-17 00:51:04,776 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 12546 transitions. Word has length 168 [2021-11-17 00:51:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:04,776 INFO L470 AbstractCegarLoop]: Abstraction has 8858 states and 12546 transitions. [2021-11-17 00:51:04,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 00:51:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 12546 transitions. [2021-11-17 00:51:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-17 00:51:04,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:04,788 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:04,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:51:04,788 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1255892641, now seen corresponding path program 1 times [2021-11-17 00:51:04,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:04,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692942163] [2021-11-17 00:51:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:04,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 00:51:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-17 00:51:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 00:51:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 00:51:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-17 00:51:05,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:05,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692942163] [2021-11-17 00:51:05,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692942163] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:51:05,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760953182] [2021-11-17 00:51:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:05,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:51:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:51:05,122 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-17 00:51:05,127 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-17 00:51:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:05,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 00:51:05,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:51:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-11-17 00:51:05,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:51:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-11-17 00:51:06,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760953182] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:51:06,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:51:06,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 18 [2021-11-17 00:51:06,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176307734] [2021-11-17 00:51:06,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:51:06,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-17 00:51:06,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:06,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-17 00:51:06,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-11-17 00:51:06,814 INFO L87 Difference]: Start difference. First operand 8858 states and 12546 transitions. Second operand has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2021-11-17 00:51:14,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:16,036 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:18,059 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:21,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:23,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:24,089 INFO L93 Difference]: Finished difference Result 25915 states and 37319 transitions. [2021-11-17 00:51:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-17 00:51:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) Word has length 170 [2021-11-17 00:51:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:24,145 INFO L225 Difference]: With dead ends: 25915 [2021-11-17 00:51:24,146 INFO L226 Difference]: Without dead ends: 17092 [2021-11-17 00:51:24,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=424, Invalid=1468, Unknown=0, NotChecked=0, Total=1892 [2021-11-17 00:51:24,172 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 6345 mSDsluCounter, 6325 mSDsCounter, 0 mSdLazyCounter, 9533 mSolverCounterSat, 2494 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6479 SdHoareTripleChecker+Valid, 7618 SdHoareTripleChecker+Invalid, 12032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2494 IncrementalHoareTripleChecker+Valid, 9533 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:24,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6479 Valid, 7618 Invalid, 12032 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2494 Valid, 9533 Invalid, 5 Unknown, 0 Unchecked, 16.4s Time] [2021-11-17 00:51:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17092 states. [2021-11-17 00:51:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17092 to 15079. [2021-11-17 00:51:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15079 states, 12027 states have (on average 1.4122391286272553) internal successors, (16985), 12237 states have internal predecessors, (16985), 2108 states have call successors, (2108), 888 states have call predecessors, (2108), 943 states have return successors, (2377), 2103 states have call predecessors, (2377), 2107 states have call successors, (2377) [2021-11-17 00:51:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 21470 transitions. [2021-11-17 00:51:24,683 INFO L78 Accepts]: Start accepts. Automaton has 15079 states and 21470 transitions. Word has length 170 [2021-11-17 00:51:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:24,684 INFO L470 AbstractCegarLoop]: Abstraction has 15079 states and 21470 transitions. [2021-11-17 00:51:24,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 10.647058823529411) internal successors, (181), 14 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 7 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2021-11-17 00:51:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15079 states and 21470 transitions. [2021-11-17 00:51:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-17 00:51:24,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:24,698 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:24,720 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-17 00:51:24,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:51:24,912 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -221570316, now seen corresponding path program 1 times [2021-11-17 00:51:24,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:24,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442456062] [2021-11-17 00:51:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:24,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 00:51:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 00:51:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 00:51:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-17 00:51:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 00:51:25,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:25,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442456062] [2021-11-17 00:51:25,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442456062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:25,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:51:25,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:51:25,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482758395] [2021-11-17 00:51:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:25,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:51:25,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:51:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:51:25,076 INFO L87 Difference]: Start difference. First operand 15079 states and 21470 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:51:29,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:31,689 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:33,734 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:35,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:35,955 INFO L93 Difference]: Finished difference Result 37498 states and 53305 transitions. [2021-11-17 00:51:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:51:35,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 195 [2021-11-17 00:51:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:36,063 INFO L225 Difference]: With dead ends: 37498 [2021-11-17 00:51:36,064 INFO L226 Difference]: Without dead ends: 22454 [2021-11-17 00:51:36,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:51:36,091 INFO L933 BasicCegarLoop]: 1620 mSDtfsCounter, 1180 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 300 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:36,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 4570 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 2245 Invalid, 4 Unknown, 0 Unchecked, 10.3s Time] [2021-11-17 00:51:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22454 states. [2021-11-17 00:51:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22454 to 15103. [2021-11-17 00:51:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15103 states, 12051 states have (on average 1.4114181395734793) internal successors, (17009), 12261 states have internal predecessors, (17009), 2108 states have call successors, (2108), 888 states have call predecessors, (2108), 943 states have return successors, (2377), 2103 states have call predecessors, (2377), 2107 states have call successors, (2377) [2021-11-17 00:51:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15103 states to 15103 states and 21494 transitions. [2021-11-17 00:51:36,594 INFO L78 Accepts]: Start accepts. Automaton has 15103 states and 21494 transitions. Word has length 195 [2021-11-17 00:51:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:36,594 INFO L470 AbstractCegarLoop]: Abstraction has 15103 states and 21494 transitions. [2021-11-17 00:51:36,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:51:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15103 states and 21494 transitions. [2021-11-17 00:51:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 00:51:36,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:36,608 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:36,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 00:51:36,608 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1895509465, now seen corresponding path program 1 times [2021-11-17 00:51:36,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:36,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503061993] [2021-11-17 00:51:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:36,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:51:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:51:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:51:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 00:51:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 00:51:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-17 00:51:36,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:36,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503061993] [2021-11-17 00:51:36,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503061993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:36,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:51:36,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 00:51:36,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63833592] [2021-11-17 00:51:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:36,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:51:36,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:36,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:51:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:51:36,979 INFO L87 Difference]: Start difference. First operand 15103 states and 21494 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 00:51:40,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:40,883 INFO L93 Difference]: Finished difference Result 31791 states and 45334 transitions. [2021-11-17 00:51:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:51:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2021-11-17 00:51:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:40,937 INFO L225 Difference]: With dead ends: 31791 [2021-11-17 00:51:40,938 INFO L226 Difference]: Without dead ends: 16723 [2021-11-17 00:51:40,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-17 00:51:40,968 INFO L933 BasicCegarLoop]: 939 mSDtfsCounter, 880 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 423 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:40,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 3313 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1556 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2021-11-17 00:51:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16723 states. [2021-11-17 00:51:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16723 to 15151. [2021-11-17 00:51:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15151 states, 12087 states have (on average 1.4101927690907587) internal successors, (17045), 12297 states have internal predecessors, (17045), 2108 states have call successors, (2108), 888 states have call predecessors, (2108), 955 states have return successors, (2392), 2115 states have call predecessors, (2392), 2107 states have call successors, (2392) [2021-11-17 00:51:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15151 states to 15151 states and 21545 transitions. [2021-11-17 00:51:41,382 INFO L78 Accepts]: Start accepts. Automaton has 15151 states and 21545 transitions. Word has length 206 [2021-11-17 00:51:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:41,383 INFO L470 AbstractCegarLoop]: Abstraction has 15151 states and 21545 transitions. [2021-11-17 00:51:41,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 00:51:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15151 states and 21545 transitions. [2021-11-17 00:51:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-17 00:51:41,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:41,395 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:41,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 00:51:41,396 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -938971650, now seen corresponding path program 1 times [2021-11-17 00:51:41,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:41,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146392711] [2021-11-17 00:51:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:41,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:51:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:51:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:51:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-17 00:51:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:51:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-11-17 00:51:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 00:51:41,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:41,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146392711] [2021-11-17 00:51:41,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146392711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:51:41,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380068773] [2021-11-17 00:51:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:41,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:51:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:51:41,574 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-17 00:51:41,577 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-17 00:51:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:41,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:51:41,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:51:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-17 00:51:42,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:51:42,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380068773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:42,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:51:42,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-11-17 00:51:42,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37569997] [2021-11-17 00:51:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:42,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:51:42,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:51:42,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:51:42,370 INFO L87 Difference]: Start difference. First operand 15151 states and 21545 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-17 00:51:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:43,040 INFO L93 Difference]: Finished difference Result 36934 states and 52492 transitions. [2021-11-17 00:51:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:51:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 213 [2021-11-17 00:51:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:43,098 INFO L225 Difference]: With dead ends: 36934 [2021-11-17 00:51:43,098 INFO L226 Difference]: Without dead ends: 21818 [2021-11-17 00:51:43,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:51:43,121 INFO L933 BasicCegarLoop]: 1929 mSDtfsCounter, 1289 mSDsluCounter, 4227 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 6156 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:43,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1295 Valid, 6156 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:51:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21818 states. [2021-11-17 00:51:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21818 to 15163. [2021-11-17 00:51:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15163 states, 12099 states have (on average 1.4097859327217126) internal successors, (17057), 12297 states have internal predecessors, (17057), 2108 states have call successors, (2108), 888 states have call predecessors, (2108), 955 states have return successors, (2392), 2115 states have call predecessors, (2392), 2107 states have call successors, (2392) [2021-11-17 00:51:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 21557 transitions. [2021-11-17 00:51:43,604 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 21557 transitions. Word has length 213 [2021-11-17 00:51:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:43,604 INFO L470 AbstractCegarLoop]: Abstraction has 15163 states and 21557 transitions. [2021-11-17 00:51:43,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-17 00:51:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 21557 transitions. [2021-11-17 00:51:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-11-17 00:51:43,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:43,616 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:43,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-17 00:51:43,831 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-17 00:51:43,832 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2081050121, now seen corresponding path program 1 times [2021-11-17 00:51:43,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:43,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779064884] [2021-11-17 00:51:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:43,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:51:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 00:51:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:51:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 00:51:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 00:51:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:51:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 00:51:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 00:51:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 00:51:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-11-17 00:51:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:51:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2021-11-17 00:51:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-11-17 00:51:44,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:44,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779064884] [2021-11-17 00:51:44,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779064884] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:51:44,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59167242] [2021-11-17 00:51:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:44,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:51:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:51:44,094 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-17 00:51:44,096 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-17 00:51:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:44,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 1746 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:51:44,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:51:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-17 00:51:44,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:51:44,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59167242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:44,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:51:44,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2021-11-17 00:51:44,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639298325] [2021-11-17 00:51:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:44,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:51:44,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:51:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:51:44,961 INFO L87 Difference]: Start difference. First operand 15163 states and 21557 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 00:51:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:45,668 INFO L93 Difference]: Finished difference Result 20545 states and 28993 transitions. [2021-11-17 00:51:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:51:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 251 [2021-11-17 00:51:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:45,730 INFO L225 Difference]: With dead ends: 20545 [2021-11-17 00:51:45,731 INFO L226 Difference]: Without dead ends: 20536 [2021-11-17 00:51:45,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:51:45,744 INFO L933 BasicCegarLoop]: 1738 mSDtfsCounter, 1802 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:45,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1802 Valid, 2336 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:51:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20536 states. [2021-11-17 00:51:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20536 to 19019. [2021-11-17 00:51:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19019 states, 15131 states have (on average 1.4011631749388673) internal successors, (21201), 15379 states have internal predecessors, (21201), 2666 states have call successors, (2666), 1130 states have call predecessors, (2666), 1221 states have return successors, (3054), 2677 states have call predecessors, (3054), 2665 states have call successors, (3054) [2021-11-17 00:51:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19019 states to 19019 states and 26921 transitions. [2021-11-17 00:51:46,420 INFO L78 Accepts]: Start accepts. Automaton has 19019 states and 26921 transitions. Word has length 251 [2021-11-17 00:51:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:46,421 INFO L470 AbstractCegarLoop]: Abstraction has 19019 states and 26921 transitions. [2021-11-17 00:51:46,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 4 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 00:51:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19019 states and 26921 transitions. [2021-11-17 00:51:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-11-17 00:51:46,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:46,435 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:46,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-17 00:51:46,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:51:46,651 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -123600559, now seen corresponding path program 1 times [2021-11-17 00:51:46,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:46,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246300525] [2021-11-17 00:51:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:46,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:51:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 00:51:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:51:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 00:51:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 00:51:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:51:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 00:51:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 00:51:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 00:51:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-11-17 00:51:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:51:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2021-11-17 00:51:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-11-17 00:51:46,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:46,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246300525] [2021-11-17 00:51:46,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246300525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:46,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:51:46,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:51:46,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805970533] [2021-11-17 00:51:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:46,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:51:46,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:51:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:51:46,899 INFO L87 Difference]: Start difference. First operand 19019 states and 26921 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:51:49,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:51,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:51:52,180 INFO L93 Difference]: Finished difference Result 29377 states and 41661 transitions. [2021-11-17 00:51:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:51:52,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 255 [2021-11-17 00:51:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:51:52,207 INFO L225 Difference]: With dead ends: 29377 [2021-11-17 00:51:52,208 INFO L226 Difference]: Without dead ends: 8916 [2021-11-17 00:51:52,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:51:52,243 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 1474 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 467 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:51:52,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1901 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 568 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2021-11-17 00:51:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2021-11-17 00:51:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 8163. [2021-11-17 00:51:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 6470 states have (on average 1.3877897990726429) internal successors, (8979), 6577 states have internal predecessors, (8979), 1145 states have call successors, (1145), 504 states have call predecessors, (1145), 547 states have return successors, (1318), 1156 states have call predecessors, (1318), 1144 states have call successors, (1318) [2021-11-17 00:51:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 11442 transitions. [2021-11-17 00:51:52,493 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 11442 transitions. Word has length 255 [2021-11-17 00:51:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:51:52,494 INFO L470 AbstractCegarLoop]: Abstraction has 8163 states and 11442 transitions. [2021-11-17 00:51:52,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:51:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 11442 transitions. [2021-11-17 00:51:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-11-17 00:51:52,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:51:52,502 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:51:52,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 00:51:52,502 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:51:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:51:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1221651547, now seen corresponding path program 1 times [2021-11-17 00:51:52,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:51:52,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69048544] [2021-11-17 00:51:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:51:52,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:51:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:51:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:51:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:51:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:51:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:51:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:51:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:51:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:51:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:51:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:51:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:51:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:51:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:51:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-17 00:51:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 00:51:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 00:51:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 00:51:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-17 00:51:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 00:51:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 00:51:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 00:51:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-11-17 00:51:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:51:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2021-11-17 00:51:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:51:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-17 00:51:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:51:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-11-17 00:51:52,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:51:52,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69048544] [2021-11-17 00:51:52,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69048544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:51:52,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:51:52,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-17 00:51:52,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937021528] [2021-11-17 00:51:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:51:52,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 00:51:52,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:51:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 00:51:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:51:52,880 INFO L87 Difference]: Start difference. First operand 8163 states and 11442 transitions. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 00:51:57,016 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:51:59,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:01,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:01,655 INFO L93 Difference]: Finished difference Result 19182 states and 27320 transitions. [2021-11-17 00:52:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:52:01,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 268 [2021-11-17 00:52:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:01,686 INFO L225 Difference]: With dead ends: 19182 [2021-11-17 00:52:01,686 INFO L226 Difference]: Without dead ends: 11100 [2021-11-17 00:52:01,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-17 00:52:01,706 INFO L933 BasicCegarLoop]: 1227 mSDtfsCounter, 2392 mSDsluCounter, 5872 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 818 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 7099 SdHoareTripleChecker+Invalid, 4095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:01,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2444 Valid, 7099 Invalid, 4095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 3274 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2021-11-17 00:52:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11100 states. [2021-11-17 00:52:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11100 to 8233. [2021-11-17 00:52:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8233 states, 6530 states have (on average 1.3842266462480857) internal successors, (9039), 6637 states have internal predecessors, (9039), 1145 states have call successors, (1145), 504 states have call predecessors, (1145), 557 states have return successors, (1328), 1166 states have call predecessors, (1328), 1144 states have call successors, (1328) [2021-11-17 00:52:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 11512 transitions. [2021-11-17 00:52:02,059 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 11512 transitions. Word has length 268 [2021-11-17 00:52:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:02,060 INFO L470 AbstractCegarLoop]: Abstraction has 8233 states and 11512 transitions. [2021-11-17 00:52:02,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-17 00:52:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 11512 transitions. [2021-11-17 00:52:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-11-17 00:52:02,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:02,068 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:02,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 00:52:02,068 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash 482169222, now seen corresponding path program 1 times [2021-11-17 00:52:02,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:02,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514491715] [2021-11-17 00:52:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:02,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 00:52:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 00:52:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 00:52:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-17 00:52:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-11-17 00:52:02,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:02,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514491715] [2021-11-17 00:52:02,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514491715] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:52:02,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134195141] [2021-11-17 00:52:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:02,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:52:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:52:02,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:52:02,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 00:52:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:02,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 1843 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 00:52:02,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:52:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-11-17 00:52:03,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:52:03,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134195141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:52:03,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:52:03,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2021-11-17 00:52:03,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904651741] [2021-11-17 00:52:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:52:03,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:52:03,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:52:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:52:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:52:03,213 INFO L87 Difference]: Start difference. First operand 8233 states and 11512 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:52:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:03,446 INFO L93 Difference]: Finished difference Result 16435 states and 22984 transitions. [2021-11-17 00:52:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:52:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2021-11-17 00:52:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:03,467 INFO L225 Difference]: With dead ends: 16435 [2021-11-17 00:52:03,467 INFO L226 Difference]: Without dead ends: 8232 [2021-11-17 00:52:03,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:52:03,484 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 6 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:03,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 4067 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:52:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8232 states. [2021-11-17 00:52:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8232 to 8232. [2021-11-17 00:52:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8232 states, 6529 states have (on average 1.3839791698575585) internal successors, (9036), 6636 states have internal predecessors, (9036), 1145 states have call successors, (1145), 504 states have call predecessors, (1145), 557 states have return successors, (1328), 1166 states have call predecessors, (1328), 1144 states have call successors, (1328) [2021-11-17 00:52:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8232 states to 8232 states and 11509 transitions. [2021-11-17 00:52:03,820 INFO L78 Accepts]: Start accepts. Automaton has 8232 states and 11509 transitions. Word has length 274 [2021-11-17 00:52:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:03,820 INFO L470 AbstractCegarLoop]: Abstraction has 8232 states and 11509 transitions. [2021-11-17 00:52:03,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:52:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8232 states and 11509 transitions. [2021-11-17 00:52:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-11-17 00:52:03,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:03,827 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:03,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-17 00:52:04,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:52:04,028 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash -390241340, now seen corresponding path program 1 times [2021-11-17 00:52:04,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:04,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96299916] [2021-11-17 00:52:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:04,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 00:52:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 00:52:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 00:52:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-17 00:52:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-11-17 00:52:04,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:04,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96299916] [2021-11-17 00:52:04,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96299916] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:52:04,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346694867] [2021-11-17 00:52:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:04,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:52:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:52:04,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:52:04,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-17 00:52:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:04,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-17 00:52:04,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:52:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 87 proven. 14 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-11-17 00:52:05,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:52:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-11-17 00:52:06,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346694867] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:52:06,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:52:06,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2021-11-17 00:52:06,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461467030] [2021-11-17 00:52:06,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:52:06,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-17 00:52:06,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:52:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-17 00:52:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:52:06,248 INFO L87 Difference]: Start difference. First operand 8232 states and 11509 transitions. Second operand has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) [2021-11-17 00:52:10,877 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:14,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:16,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:18,985 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:19,051 INFO L93 Difference]: Finished difference Result 23747 states and 34514 transitions. [2021-11-17 00:52:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 00:52:19,052 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) Word has length 274 [2021-11-17 00:52:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:19,098 INFO L225 Difference]: With dead ends: 23747 [2021-11-17 00:52:19,098 INFO L226 Difference]: Without dead ends: 15595 [2021-11-17 00:52:19,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 593 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-17 00:52:19,119 INFO L933 BasicCegarLoop]: 1635 mSDtfsCounter, 2265 mSDsluCounter, 16173 mSDsCounter, 0 mSdLazyCounter, 6156 mSolverCounterSat, 732 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 17808 SdHoareTripleChecker+Invalid, 6892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 6156 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:19,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2434 Valid, 17808 Invalid, 6892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 6156 Invalid, 4 Unknown, 0 Unchecked, 12.2s Time] [2021-11-17 00:52:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15595 states. [2021-11-17 00:52:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15595 to 11582. [2021-11-17 00:52:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11582 states, 9379 states have (on average 1.4023883143192237) internal successors, (13153), 9500 states have internal predecessors, (13153), 1644 states have call successors, (1644), 504 states have call predecessors, (1644), 558 states have return successors, (1918), 1676 states have call predecessors, (1918), 1643 states have call successors, (1918) [2021-11-17 00:52:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11582 states to 11582 states and 16715 transitions. [2021-11-17 00:52:19,517 INFO L78 Accepts]: Start accepts. Automaton has 11582 states and 16715 transitions. Word has length 274 [2021-11-17 00:52:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:19,517 INFO L470 AbstractCegarLoop]: Abstraction has 11582 states and 16715 transitions. [2021-11-17 00:52:19,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 11 states have internal predecessors, (265), 6 states have call successors, (67), 6 states have call predecessors, (67), 4 states have return successors, (51), 8 states have call predecessors, (51), 6 states have call successors, (51) [2021-11-17 00:52:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11582 states and 16715 transitions. [2021-11-17 00:52:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-11-17 00:52:19,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:19,527 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:19,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 00:52:19,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 00:52:19,730 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1448079418, now seen corresponding path program 1 times [2021-11-17 00:52:19,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:19,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134146561] [2021-11-17 00:52:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:19,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 00:52:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-11-17 00:52:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 00:52:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-17 00:52:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2021-11-17 00:52:20,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:20,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134146561] [2021-11-17 00:52:20,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134146561] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:52:20,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:52:20,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 00:52:20,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566143165] [2021-11-17 00:52:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:52:20,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:52:20,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:52:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:52:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:52:20,060 INFO L87 Difference]: Start difference. First operand 11582 states and 16715 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:52:23,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:26,868 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:27,124 INFO L93 Difference]: Finished difference Result 28120 states and 41308 transitions. [2021-11-17 00:52:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:52:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 274 [2021-11-17 00:52:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:27,182 INFO L225 Difference]: With dead ends: 28120 [2021-11-17 00:52:27,182 INFO L226 Difference]: Without dead ends: 16660 [2021-11-17 00:52:27,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:52:27,214 INFO L933 BasicCegarLoop]: 1283 mSDtfsCounter, 911 mSDsluCounter, 5552 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 291 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 6835 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:27,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 6835 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 2653 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2021-11-17 00:52:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16660 states. [2021-11-17 00:52:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16660 to 11630. [2021-11-17 00:52:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11630 states, 9421 states have (on average 1.400594416728585) internal successors, (13195), 9536 states have internal predecessors, (13195), 1644 states have call successors, (1644), 504 states have call predecessors, (1644), 564 states have return successors, (1948), 1688 states have call predecessors, (1948), 1643 states have call successors, (1948) [2021-11-17 00:52:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 16787 transitions. [2021-11-17 00:52:27,676 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 16787 transitions. Word has length 274 [2021-11-17 00:52:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:27,676 INFO L470 AbstractCegarLoop]: Abstraction has 11630 states and 16787 transitions. [2021-11-17 00:52:27,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 5 states have internal predecessors, (159), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:52:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 16787 transitions. [2021-11-17 00:52:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-11-17 00:52:27,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:27,686 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:27,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 00:52:27,687 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -631394679, now seen corresponding path program 1 times [2021-11-17 00:52:27,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:27,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974200537] [2021-11-17 00:52:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:27,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 00:52:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 00:52:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2021-11-17 00:52:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-17 00:52:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2021-11-17 00:52:28,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:28,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974200537] [2021-11-17 00:52:28,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974200537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:52:28,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:52:28,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-17 00:52:28,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224611949] [2021-11-17 00:52:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:52:28,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-17 00:52:28,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:52:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-17 00:52:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-17 00:52:28,494 INFO L87 Difference]: Start difference. First operand 11630 states and 16787 transitions. Second operand has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2021-11-17 00:52:33,332 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:35,357 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:37,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:41,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:43,045 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:45,072 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:45,784 INFO L93 Difference]: Finished difference Result 35915 states and 53674 transitions. [2021-11-17 00:52:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 00:52:45,785 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 275 [2021-11-17 00:52:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:45,853 INFO L225 Difference]: With dead ends: 35915 [2021-11-17 00:52:45,853 INFO L226 Difference]: Without dead ends: 24407 [2021-11-17 00:52:45,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-11-17 00:52:45,884 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 1586 mSDsluCounter, 15726 mSDsCounter, 0 mSdLazyCounter, 6426 mSolverCounterSat, 292 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 17241 SdHoareTripleChecker+Invalid, 6724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 6426 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:45,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1707 Valid, 17241 Invalid, 6724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 6426 Invalid, 6 Unknown, 0 Unchecked, 16.3s Time] [2021-11-17 00:52:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24407 states. [2021-11-17 00:52:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24407 to 11696. [2021-11-17 00:52:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11696 states, 9481 states have (on average 1.3974264318109904) internal successors, (13249), 9584 states have internal predecessors, (13249), 1644 states have call successors, (1644), 504 states have call predecessors, (1644), 570 states have return successors, (1966), 1706 states have call predecessors, (1966), 1643 states have call successors, (1966) [2021-11-17 00:52:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 16859 transitions. [2021-11-17 00:52:46,465 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 16859 transitions. Word has length 275 [2021-11-17 00:52:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:46,465 INFO L470 AbstractCegarLoop]: Abstraction has 11696 states and 16859 transitions. [2021-11-17 00:52:46,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.647058823529411) internal successors, (164), 11 states have internal predecessors, (164), 3 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2021-11-17 00:52:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 16859 transitions. [2021-11-17 00:52:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-17 00:52:46,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:46,475 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:46,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 00:52:46,475 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1276671932, now seen corresponding path program 1 times [2021-11-17 00:52:46,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:46,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293343764] [2021-11-17 00:52:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:46,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 00:52:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 00:52:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-17 00:52:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-11-17 00:52:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-11-17 00:52:47,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:47,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293343764] [2021-11-17 00:52:47,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293343764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:52:47,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:52:47,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-17 00:52:47,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792981683] [2021-11-17 00:52:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:52:47,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-17 00:52:47,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:52:47,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-17 00:52:47,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2021-11-17 00:52:47,308 INFO L87 Difference]: Start difference. First operand 11696 states and 16859 transitions. Second operand has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 16 states have internal predecessors, (169), 4 states have call successors, (29), 6 states have call predecessors, (29), 3 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-17 00:52:53,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:52:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:52:57,770 INFO L93 Difference]: Finished difference Result 30298 states and 44722 transitions. [2021-11-17 00:52:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-17 00:52:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 16 states have internal predecessors, (169), 4 states have call successors, (29), 6 states have call predecessors, (29), 3 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28) Word has length 283 [2021-11-17 00:52:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:52:57,821 INFO L225 Difference]: With dead ends: 30298 [2021-11-17 00:52:57,821 INFO L226 Difference]: Without dead ends: 18724 [2021-11-17 00:52:57,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2021-11-17 00:52:57,848 INFO L933 BasicCegarLoop]: 1367 mSDtfsCounter, 2604 mSDsluCounter, 11047 mSDsCounter, 0 mSdLazyCounter, 10287 mSolverCounterSat, 846 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 12414 SdHoareTripleChecker+Invalid, 11134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 10287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:52:57,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2661 Valid, 12414 Invalid, 11134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [846 Valid, 10287 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2021-11-17 00:52:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18724 states. [2021-11-17 00:52:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18724 to 11786. [2021-11-17 00:52:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11786 states, 9571 states have (on average 1.3955699508933235) internal successors, (13357), 9674 states have internal predecessors, (13357), 1644 states have call successors, (1644), 504 states have call predecessors, (1644), 570 states have return successors, (1966), 1706 states have call predecessors, (1966), 1643 states have call successors, (1966) [2021-11-17 00:52:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 16967 transitions. [2021-11-17 00:52:58,494 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 16967 transitions. Word has length 283 [2021-11-17 00:52:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:52:58,495 INFO L470 AbstractCegarLoop]: Abstraction has 11786 states and 16967 transitions. [2021-11-17 00:52:58,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 16 states have internal predecessors, (169), 4 states have call successors, (29), 6 states have call predecessors, (29), 3 states have return successors, (28), 6 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-17 00:52:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 16967 transitions. [2021-11-17 00:52:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-17 00:52:58,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:52:58,504 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:52:58,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 00:52:58,504 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:52:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:52:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2142276358, now seen corresponding path program 1 times [2021-11-17 00:52:58,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:52:58,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692535656] [2021-11-17 00:52:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:58,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:52:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-17 00:52:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 00:52:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:52:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-17 00:52:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:52:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:52:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-17 00:52:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 00:52:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-17 00:52:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 00:52:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 00:52:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 00:52:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:52:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 00:52:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 00:52:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 00:52:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 00:52:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 00:52:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 00:52:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 00:52:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 00:52:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 00:52:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:52:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-17 00:52:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:52:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-11-17 00:52:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:52:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-11-17 00:52:59,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:52:59,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692535656] [2021-11-17 00:52:59,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692535656] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:52:59,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138354326] [2021-11-17 00:52:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:52:59,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:52:59,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:52:59,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:52:59,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-17 00:53:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:00,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 1890 conjuncts, 130 conjunts are in the unsatisfiable core [2021-11-17 00:53:00,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:00,724 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-17 00:53:02,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:53:02,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-17 00:53:02,694 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-17 00:53:02,695 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 2 case distinctions, treesize of input 20 treesize of output 20 [2021-11-17 00:53:02,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:53:02,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:53:02,899 INFO L354 Elim1Store]: treesize reduction 45, result has 28.6 percent of original size [2021-11-17 00:53:02,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2021-11-17 00:53:03,040 INFO L354 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2021-11-17 00:53:03,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 31 [2021-11-17 00:53:03,280 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-17 00:53:03,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 41 [2021-11-17 00:53:03,324 INFO L354 Elim1Store]: treesize reduction 130, result has 14.5 percent of original size [2021-11-17 00:53:03,324 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 4 case distinctions, treesize of input 44 treesize of output 51 [2021-11-17 00:53:04,275 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 00:53:04,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2021-11-17 00:53:05,021 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 00:53:05,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-17 00:53:05,084 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 7 treesize of output 6 [2021-11-17 00:53:05,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-11-17 00:53:05,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:53:05,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2021-11-17 00:53:05,600 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 27 treesize of output 6 [2021-11-17 00:53:05,694 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-17 00:53:05,694 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 26 treesize of output 24 [2021-11-17 00:53:05,761 INFO L354 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2021-11-17 00:53:05,762 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 30 treesize of output 30 [2021-11-17 00:53:05,773 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 27 treesize of output 11 [2021-11-17 00:53:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 104 proven. 7 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2021-11-17 00:53:05,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:07,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3| Int) (|ULTIMATE.start_ppp_async_input_~ap#1.offset| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int) (v_DerPreprocessor_1 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base|) (+ 250 |ULTIMATE.start_ppp_async_input_~ap#1.offset|) v_DerPreprocessor_1)) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|))) (or (not (= (mod (select .cse0 (+ 108 |v_ULTIMATE.start_skb_is_nonlinear_~skb#1.offset_3|)) 4294967296) 0)) (= (mod (select .cse0 (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)))) is different from false [2021-11-17 00:53:10,465 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (ite Bool Int (Array Int Int)) [2021-11-17 00:53:10,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:53:10,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2021-11-17 00:53:10,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73994724] [2021-11-17 00:53:10,466 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 00:53:10,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-17 00:53:10,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-17 00:53:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=6645, Unknown=3, NotChecked=164, Total=7140 [2021-11-17 00:53:10,469 INFO L87 Difference]: Start difference. First operand 11786 states and 16967 transitions. Second operand has 43 states, 42 states have (on average 4.309523809523809) internal successors, (181), 34 states have internal predecessors, (181), 12 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) [2021-11-17 00:53:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 00:53:10,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 339 SyntacticMatches, 16 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=328, Invalid=6645, Unknown=3, NotChecked=164, Total=7140 [2021-11-17 00:53:10,471 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:10,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:53:10,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-17 00:53:10,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:53:10,676 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7103f307 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 00:53:10,680 INFO L158 Benchmark]: Toolchain (without parser) took 169939.14ms. Allocated memory was 104.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 67.1MB in the beginning and 1.0GB in the end (delta: -944.2MB). Peak memory consumption was 551.7MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,680 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:53:10,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1303.36ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 66.9MB in the beginning and 61.0MB in the end (delta: 6.0MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.80ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 148.3MB in the end (delta: -87.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,681 INFO L158 Benchmark]: Boogie Preprocessor took 103.77ms. Allocated memory is still 207.6MB. Free memory was 148.3MB in the beginning and 134.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,681 INFO L158 Benchmark]: RCFGBuilder took 3709.28ms. Allocated memory is still 207.6MB. Free memory was 134.6MB in the beginning and 66.6MB in the end (delta: 68.1MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,681 INFO L158 Benchmark]: TraceAbstraction took 164694.07ms. Allocated memory was 207.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 66.6MB in the beginning and 1.0GB in the end (delta: -944.8MB). Peak memory consumption was 448.9MB. Max. memory is 16.1GB. [2021-11-17 00:53:10,682 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.11ms. Allocated memory is still 104.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1303.36ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 66.9MB in the beginning and 61.0MB in the end (delta: 6.0MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.80ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 148.3MB in the end (delta: -87.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.77ms. Allocated memory is still 207.6MB. Free memory was 148.3MB in the beginning and 134.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3709.28ms. Allocated memory is still 207.6MB. Free memory was 134.6MB in the beginning and 66.6MB in the end (delta: 68.1MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * TraceAbstraction took 164694.07ms. Allocated memory was 207.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 66.6MB in the beginning and 1.0GB in the end (delta: -944.8MB). Peak memory consumption was 448.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7103f307 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7103f307: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-17 00:53:10,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.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 f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:53:12,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:53:12,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:53:12,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:53:12,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:53:12,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:53:12,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:53:12,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:53:12,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:53:12,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:53:12,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:53:12,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:53:12,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:53:12,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:53:12,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:53:12,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:53:12,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:53:12,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:53:12,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:53:12,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:53:12,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:53:12,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:53:12,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:53:12,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:53:12,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:53:12,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:53:12,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:53:12,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:53:12,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:53:12,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:53:12,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:53:12,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:53:12,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:53:12,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:53:12,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:53:12,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:53:12,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:53:12,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:53:12,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:53:12,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:53:12,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:53:12,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 00:53:12,406 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:53:12,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:53:12,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:53:12,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:53:12,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:53:12,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:53:12,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:53:12,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:53:12,410 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:53:12,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:53:12,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:53:12,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:53:12,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:53:12,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:53:12,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:53:12,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:53:12,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:53:12,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:53:12,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:53:12,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:53:12,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:53:12,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 00:53:12,414 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 -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2021-11-17 00:53:12,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:53:12,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:53:12,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:53:12,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:53:12,689 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:53:12,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:53:12,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da76678cd/fec0bb781a7c425a9db352a15fd02f4a/FLAGa9bea9fa0 [2021-11-17 00:53:13,356 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:53:13,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:53:13,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da76678cd/fec0bb781a7c425a9db352a15fd02f4a/FLAGa9bea9fa0 [2021-11-17 00:53:13,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da76678cd/fec0bb781a7c425a9db352a15fd02f4a [2021-11-17 00:53:13,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:53:13,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:53:13,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:53:13,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:53:13,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:53:13,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:53:13" (1/1) ... [2021-11-17 00:53:13,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d795c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:13, skipping insertion in model container [2021-11-17 00:53:13,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:53:13" (1/1) ... [2021-11-17 00:53:13,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:53:13,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:53:14,507 WARN L230 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2021-11-17 00:53:14,726 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:53:14,741 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:53:14,865 WARN L230 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2021-11-17 00:53:14,917 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:53:14,983 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:53:14,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14 WrapperNode [2021-11-17 00:53:14,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:53:14,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:53:14,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:53:14,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:53:14,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,113 INFO L137 Inliner]: procedures = 194, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2308 [2021-11-17 00:53:15,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:53:15,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:53:15,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:53:15,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:53:15,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:53:15,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:53:15,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:53:15,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:53:15,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (1/1) ... [2021-11-17 00:53:15,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:53:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:53:15,266 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-17 00:53:15,272 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-17 00:53:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 00:53:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 00:53:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2021-11-17 00:53:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2021-11-17 00:53:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:53:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:53:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:53:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2021-11-17 00:53:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2021-11-17 00:53:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:53:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:53:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:53:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:53:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-11-17 00:53:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-11-17 00:53:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:53:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:53:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-11-17 00:53:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-11-17 00:53:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:53:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2021-11-17 00:53:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2021-11-17 00:53:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:53:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2021-11-17 00:53:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2021-11-17 00:53:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-11-17 00:53:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-11-17 00:53:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 00:53:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-17 00:53:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 00:53:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-17 00:53:15,297 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 00:53:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 00:53:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-17 00:53:15,298 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-17 00:53:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:53:15,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:53:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-11-17 00:53:15,298 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-11-17 00:53:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-11-17 00:53:15,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-11-17 00:53:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2021-11-17 00:53:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2021-11-17 00:53:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2021-11-17 00:53:15,328 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2021-11-17 00:53:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2021-11-17 00:53:15,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2021-11-17 00:53:15,329 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2021-11-17 00:53:15,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2021-11-17 00:53:15,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:53:15,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:53:15,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2021-11-17 00:53:15,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2021-11-17 00:53:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-17 00:53:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-17 00:53:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2021-11-17 00:53:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2021-11-17 00:53:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2021-11-17 00:53:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2021-11-17 00:53:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:53:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 00:53:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 00:53:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2021-11-17 00:53:15,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2021-11-17 00:53:15,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2021-11-17 00:53:15,332 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:53:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-17 00:53:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-17 00:53:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-17 00:53:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-11-17 00:53:15,334 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-11-17 00:53:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2021-11-17 00:53:15,334 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2021-11-17 00:53:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-11-17 00:53:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-11-17 00:53:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2021-11-17 00:53:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2021-11-17 00:53:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-17 00:53:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:53:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:53:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2021-11-17 00:53:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2021-11-17 00:53:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-17 00:53:15,336 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-17 00:53:15,742 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:53:15,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:53:16,304 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:53:21,200 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:53:21,210 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:53:21,211 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-17 00:53:21,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:53:21 BoogieIcfgContainer [2021-11-17 00:53:21,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:53:21,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:53:21,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:53:21,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:53:21,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:53:13" (1/3) ... [2021-11-17 00:53:21,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eeb867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:53:21, skipping insertion in model container [2021-11-17 00:53:21,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:14" (2/3) ... [2021-11-17 00:53:21,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eeb867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:53:21, skipping insertion in model container [2021-11-17 00:53:21,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:53:21" (3/3) ... [2021-11-17 00:53:21,219 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2021-11-17 00:53:21,222 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:53:21,222 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:53:21,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:53:21,259 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-17 00:53:21,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:53:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 569 states have (on average 1.437609841827768) internal successors, (818), 583 states have internal predecessors, (818), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2021-11-17 00:53:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-17 00:53:21,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:21,285 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:21,286 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1655853119, now seen corresponding path program 1 times [2021-11-17 00:53:21,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:21,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740220937] [2021-11-17 00:53:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:21,299 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:21,301 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-17 00:53:21,339 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-17 00:53:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:21,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:53:21,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:53:21,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:53:22,169 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:22,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740220937] [2021-11-17 00:53:22,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740220937] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:22,170 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:22,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:53:22,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717826916] [2021-11-17 00:53:22,173 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:22,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:53:22,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:53:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:53:22,201 INFO L87 Difference]: Start difference. First operand has 723 states, 569 states have (on average 1.437609841827768) internal successors, (818), 583 states have internal predecessors, (818), 116 states have call successors, (116), 37 states have call predecessors, (116), 36 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:53:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:24,192 INFO L93 Difference]: Finished difference Result 2786 states and 4122 transitions. [2021-11-17 00:53:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:53:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2021-11-17 00:53:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:24,235 INFO L225 Difference]: With dead ends: 2786 [2021-11-17 00:53:24,235 INFO L226 Difference]: Without dead ends: 2047 [2021-11-17 00:53:24,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 152 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-17 00:53:24,246 INFO L933 BasicCegarLoop]: 1241 mSDtfsCounter, 1976 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:24,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1976 Valid, 3971 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-17 00:53:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2021-11-17 00:53:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2021-11-17 00:53:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1631 states have (on average 1.4273451870018394) internal successors, (2328), 1655 states have internal predecessors, (2328), 310 states have call successors, (310), 106 states have call predecessors, (310), 105 states have return successors, (309), 309 states have call predecessors, (309), 309 states have call successors, (309) [2021-11-17 00:53:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2947 transitions. [2021-11-17 00:53:24,387 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2947 transitions. Word has length 78 [2021-11-17 00:53:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:24,388 INFO L470 AbstractCegarLoop]: Abstraction has 2047 states and 2947 transitions. [2021-11-17 00:53:24,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:53:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2947 transitions. [2021-11-17 00:53:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-17 00:53:24,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:24,396 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:24,423 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-17 00:53:24,608 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-17 00:53:24,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 560842505, now seen corresponding path program 1 times [2021-11-17 00:53:24,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:24,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553504496] [2021-11-17 00:53:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:24,610 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:24,611 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-17 00:53:24,613 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-17 00:53:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:24,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:53:24,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:53:25,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-11-17 00:53:25,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:25,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553504496] [2021-11-17 00:53:25,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553504496] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:25,757 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:25,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-17 00:53:25,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96779250] [2021-11-17 00:53:25,757 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:25,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:53:25,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:25,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:53:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:53:25,760 INFO L87 Difference]: Start difference. First operand 2047 states and 2947 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:53:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:26,381 INFO L93 Difference]: Finished difference Result 6090 states and 8819 transitions. [2021-11-17 00:53:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:53:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2021-11-17 00:53:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:26,401 INFO L225 Difference]: With dead ends: 6090 [2021-11-17 00:53:26,401 INFO L226 Difference]: Without dead ends: 4061 [2021-11-17 00:53:26,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:53:26,410 INFO L933 BasicCegarLoop]: 1124 mSDtfsCounter, 1001 mSDsluCounter, 5488 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:26,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 6612 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:53:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2021-11-17 00:53:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 4049. [2021-11-17 00:53:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4049 states, 3229 states have (on average 1.4286156704862187) internal successors, (4613), 3277 states have internal predecessors, (4613), 609 states have call successors, (609), 211 states have call predecessors, (609), 210 states have return successors, (653), 608 states have call predecessors, (653), 608 states have call successors, (653) [2021-11-17 00:53:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 5875 transitions. [2021-11-17 00:53:26,593 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 5875 transitions. Word has length 82 [2021-11-17 00:53:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:26,594 INFO L470 AbstractCegarLoop]: Abstraction has 4049 states and 5875 transitions. [2021-11-17 00:53:26,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-17 00:53:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 5875 transitions. [2021-11-17 00:53:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-17 00:53:26,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:26,601 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:26,614 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-17 00:53:26,814 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-17 00:53:26,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1064027300, now seen corresponding path program 1 times [2021-11-17 00:53:26,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:26,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891592026] [2021-11-17 00:53:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:26,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:26,822 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-17 00:53:26,824 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-17 00:53:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:27,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:53:27,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-17 00:53:27,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-11-17 00:53:28,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:28,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891592026] [2021-11-17 00:53:28,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891592026] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:28,075 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:28,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:53:28,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297046299] [2021-11-17 00:53:28,075 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:28,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:53:28,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:53:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:53:28,076 INFO L87 Difference]: Start difference. First operand 4049 states and 5875 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 00:53:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:28,479 INFO L93 Difference]: Finished difference Result 10018 states and 14546 transitions. [2021-11-17 00:53:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:53:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2021-11-17 00:53:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:28,507 INFO L225 Difference]: With dead ends: 10018 [2021-11-17 00:53:28,508 INFO L226 Difference]: Without dead ends: 5993 [2021-11-17 00:53:28,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 277 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-17 00:53:28,522 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 523 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:28,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 2050 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:53:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2021-11-17 00:53:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5980. [2021-11-17 00:53:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5980 states, 4777 states have (on average 1.4358383922964204) internal successors, (6859), 4839 states have internal predecessors, (6859), 884 states have call successors, (884), 319 states have call predecessors, (884), 318 states have return successors, (943), 881 states have call predecessors, (943), 883 states have call successors, (943) [2021-11-17 00:53:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5980 states to 5980 states and 8686 transitions. [2021-11-17 00:53:28,705 INFO L78 Accepts]: Start accepts. Automaton has 5980 states and 8686 transitions. Word has length 140 [2021-11-17 00:53:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:28,707 INFO L470 AbstractCegarLoop]: Abstraction has 5980 states and 8686 transitions. [2021-11-17 00:53:28,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 00:53:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5980 states and 8686 transitions. [2021-11-17 00:53:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-17 00:53:28,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:28,721 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:28,736 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-17 00:53:28,936 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-17 00:53:28,936 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash -920681887, now seen corresponding path program 1 times [2021-11-17 00:53:28,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:28,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253655988] [2021-11-17 00:53:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:28,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:28,940 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-17 00:53:28,943 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-17 00:53:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:29,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:53:29,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-17 00:53:30,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-17 00:53:30,501 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:30,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253655988] [2021-11-17 00:53:30,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253655988] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:30,501 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:30,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:53:30,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223767849] [2021-11-17 00:53:30,502 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:30,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:53:30,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:53:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:53:30,503 INFO L87 Difference]: Start difference. First operand 5980 states and 8686 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 00:53:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:30,776 INFO L93 Difference]: Finished difference Result 14748 states and 21267 transitions. [2021-11-17 00:53:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:53:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 169 [2021-11-17 00:53:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:30,814 INFO L225 Difference]: With dead ends: 14748 [2021-11-17 00:53:30,815 INFO L226 Difference]: Without dead ends: 8803 [2021-11-17 00:53:30,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 335 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-17 00:53:30,834 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 670 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:30,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [670 Valid, 2560 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:53:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8803 states. [2021-11-17 00:53:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8803 to 8779. [2021-11-17 00:53:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8779 states, 7048 states have (on average 1.422673098751419) internal successors, (10027), 7146 states have internal predecessors, (10027), 1232 states have call successors, (1232), 499 states have call predecessors, (1232), 498 states have return successors, (1324), 1229 states have call predecessors, (1324), 1231 states have call successors, (1324) [2021-11-17 00:53:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8779 states to 8779 states and 12583 transitions. [2021-11-17 00:53:31,144 INFO L78 Accepts]: Start accepts. Automaton has 8779 states and 12583 transitions. Word has length 169 [2021-11-17 00:53:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:31,145 INFO L470 AbstractCegarLoop]: Abstraction has 8779 states and 12583 transitions. [2021-11-17 00:53:31,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 00:53:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8779 states and 12583 transitions. [2021-11-17 00:53:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 00:53:31,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:31,160 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:31,175 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-17 00:53:31,375 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-17 00:53:31,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 42300810, now seen corresponding path program 1 times [2021-11-17 00:53:31,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:31,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876337365] [2021-11-17 00:53:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:31,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:31,380 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-17 00:53:31,382 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-17 00:53:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:53:31,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2021-11-17 00:53:32,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-11-17 00:53:32,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:32,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876337365] [2021-11-17 00:53:32,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876337365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:32,968 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:32,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-17 00:53:32,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942052915] [2021-11-17 00:53:32,969 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:32,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:53:32,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:53:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:53:32,970 INFO L87 Difference]: Start difference. First operand 8779 states and 12583 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 00:53:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:33,323 INFO L93 Difference]: Finished difference Result 14692 states and 21060 transitions. [2021-11-17 00:53:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:53:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 163 [2021-11-17 00:53:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:33,351 INFO L225 Difference]: With dead ends: 14692 [2021-11-17 00:53:33,352 INFO L226 Difference]: Without dead ends: 5928 [2021-11-17 00:53:33,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:53:33,370 INFO L933 BasicCegarLoop]: 1024 mSDtfsCounter, 24 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:33,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 4086 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:53:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2021-11-17 00:53:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5882. [2021-11-17 00:53:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5882 states, 4719 states have (on average 1.4223352405170586) internal successors, (6712), 4785 states have internal predecessors, (6712), 828 states have call successors, (828), 335 states have call predecessors, (828), 334 states have return successors, (889), 825 states have call predecessors, (889), 827 states have call successors, (889) [2021-11-17 00:53:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 8429 transitions. [2021-11-17 00:53:33,624 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 8429 transitions. Word has length 163 [2021-11-17 00:53:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:33,624 INFO L470 AbstractCegarLoop]: Abstraction has 5882 states and 8429 transitions. [2021-11-17 00:53:33,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 00:53:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 8429 transitions. [2021-11-17 00:53:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-17 00:53:33,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:33,634 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:33,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-17 00:53:33,834 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-17 00:53:33,834 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1898281204, now seen corresponding path program 1 times [2021-11-17 00:53:33,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:33,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202133348] [2021-11-17 00:53:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:33,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:33,838 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-17 00:53:33,840 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-17 00:53:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:34,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:53:34,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2021-11-17 00:53:34,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2021-11-17 00:53:35,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:35,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202133348] [2021-11-17 00:53:35,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202133348] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:35,193 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:35,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:53:35,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798190973] [2021-11-17 00:53:35,193 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:35,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:53:35,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:53:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:53:35,194 INFO L87 Difference]: Start difference. First operand 5882 states and 8429 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:53:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:36,777 INFO L93 Difference]: Finished difference Result 15892 states and 22869 transitions. [2021-11-17 00:53:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:53:36,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 163 [2021-11-17 00:53:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:36,817 INFO L225 Difference]: With dead ends: 15892 [2021-11-17 00:53:36,817 INFO L226 Difference]: Without dead ends: 10060 [2021-11-17 00:53:36,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 322 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-17 00:53:36,856 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1797 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:36,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 2483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 00:53:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10060 states. [2021-11-17 00:53:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10060 to 9992. [2021-11-17 00:53:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9992 states, 8067 states have (on average 1.4258088508739308) internal successors, (11502), 8167 states have internal predecessors, (11502), 1332 states have call successors, (1332), 593 states have call predecessors, (1332), 592 states have return successors, (1431), 1327 states have call predecessors, (1431), 1331 states have call successors, (1431) [2021-11-17 00:53:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9992 states to 9992 states and 14265 transitions. [2021-11-17 00:53:37,123 INFO L78 Accepts]: Start accepts. Automaton has 9992 states and 14265 transitions. Word has length 163 [2021-11-17 00:53:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:37,124 INFO L470 AbstractCegarLoop]: Abstraction has 9992 states and 14265 transitions. [2021-11-17 00:53:37,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-17 00:53:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9992 states and 14265 transitions. [2021-11-17 00:53:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-17 00:53:37,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:37,137 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:37,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-17 00:53:37,349 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-17 00:53:37,350 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 66754132, now seen corresponding path program 1 times [2021-11-17 00:53:37,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:37,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541555770] [2021-11-17 00:53:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:37,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:37,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:37,352 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-17 00:53:37,354 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-17 00:53:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:53:37,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-11-17 00:53:38,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-11-17 00:53:38,647 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:38,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541555770] [2021-11-17 00:53:38,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541555770] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:38,647 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:38,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:53:38,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877269148] [2021-11-17 00:53:38,648 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:38,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:53:38,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:53:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:53:38,649 INFO L87 Difference]: Start difference. First operand 9992 states and 14265 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:53:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:38,812 INFO L93 Difference]: Finished difference Result 15049 states and 21636 transitions. [2021-11-17 00:53:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:53:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2021-11-17 00:53:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:38,836 INFO L225 Difference]: With dead ends: 15049 [2021-11-17 00:53:38,836 INFO L226 Difference]: Without dead ends: 10040 [2021-11-17 00:53:38,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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-17 00:53:38,850 INFO L933 BasicCegarLoop]: 1022 mSDtfsCounter, 5 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:38,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 2036 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:53:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2021-11-17 00:53:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 10040. [2021-11-17 00:53:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10040 states, 8103 states have (on average 1.4239170677526842) internal successors, (11538), 8215 states have internal predecessors, (11538), 1332 states have call successors, (1332), 593 states have call predecessors, (1332), 604 states have return successors, (1443), 1327 states have call predecessors, (1443), 1331 states have call successors, (1443) [2021-11-17 00:53:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10040 states to 10040 states and 14313 transitions. [2021-11-17 00:53:39,135 INFO L78 Accepts]: Start accepts. Automaton has 10040 states and 14313 transitions. Word has length 168 [2021-11-17 00:53:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:39,135 INFO L470 AbstractCegarLoop]: Abstraction has 10040 states and 14313 transitions. [2021-11-17 00:53:39,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-17 00:53:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10040 states and 14313 transitions. [2021-11-17 00:53:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-17 00:53:39,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:39,148 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:53:39,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-17 00:53:39,362 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-17 00:53:39,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 353394485, now seen corresponding path program 1 times [2021-11-17 00:53:39,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:53:39,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286932989] [2021-11-17 00:53:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:39,364 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:53:39,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:53:39,365 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-17 00:53:39,366 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-17 00:53:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:39,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 00:53:39,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-11-17 00:53:40,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-11-17 00:53:43,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:53:43,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286932989] [2021-11-17 00:53:43,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286932989] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:53:43,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:53:43,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-17 00:53:43,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141834068] [2021-11-17 00:53:43,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:53:43,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 00:53:43,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:53:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 00:53:43,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:53:43,984 INFO L87 Difference]: Start difference. First operand 10040 states and 14313 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 7 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29) [2021-11-17 00:54:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:08,062 INFO L93 Difference]: Finished difference Result 28023 states and 40520 transitions. [2021-11-17 00:54:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 00:54:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 7 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29) Word has length 170 [2021-11-17 00:54:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:08,117 INFO L225 Difference]: With dead ends: 28023 [2021-11-17 00:54:08,118 INFO L226 Difference]: Without dead ends: 18033 [2021-11-17 00:54:08,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-17 00:54:08,210 INFO L933 BasicCegarLoop]: 1366 mSDtfsCounter, 3182 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3344 SdHoareTripleChecker+Valid, 6734 SdHoareTripleChecker+Invalid, 4640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:08,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3344 Valid, 6734 Invalid, 4640 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [758 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2021-11-17 00:54:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18033 states. [2021-11-17 00:54:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18033 to 17310. [2021-11-17 00:54:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17310 states, 13896 states have (on average 1.4257340241796201) internal successors, (19812), 14116 states have internal predecessors, (19812), 2395 states have call successors, (2395), 991 states have call predecessors, (2395), 1018 states have return successors, (2658), 2376 states have call predecessors, (2658), 2394 states have call successors, (2658) [2021-11-17 00:54:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17310 states to 17310 states and 24865 transitions. [2021-11-17 00:54:08,666 INFO L78 Accepts]: Start accepts. Automaton has 17310 states and 24865 transitions. Word has length 170 [2021-11-17 00:54:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:08,667 INFO L470 AbstractCegarLoop]: Abstraction has 17310 states and 24865 transitions. [2021-11-17 00:54:08,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 7 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29) [2021-11-17 00:54:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 17310 states and 24865 transitions. [2021-11-17 00:54:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-17 00:54:08,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:08,681 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:08,698 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-17 00:54:08,899 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-17 00:54:08,901 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -61924638, now seen corresponding path program 1 times [2021-11-17 00:54:08,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:08,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22788063] [2021-11-17 00:54:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:08,902 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:08,904 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-17 00:54:08,905 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-17 00:54:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:09,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:54:09,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-17 00:54:09,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 00:54:10,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:10,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22788063] [2021-11-17 00:54:10,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22788063] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:10,558 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:10,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 00:54:10,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920372937] [2021-11-17 00:54:10,558 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:10,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:54:10,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:54:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:54:10,559 INFO L87 Difference]: Start difference. First operand 17310 states and 24865 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 00:54:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:12,634 INFO L93 Difference]: Finished difference Result 44998 states and 64111 transitions. [2021-11-17 00:54:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:54:12,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 195 [2021-11-17 00:54:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:12,731 INFO L225 Difference]: With dead ends: 44998 [2021-11-17 00:54:12,731 INFO L226 Difference]: Without dead ends: 27738 [2021-11-17 00:54:12,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:54:12,769 INFO L933 BasicCegarLoop]: 1807 mSDtfsCounter, 1902 mSDsluCounter, 4423 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 6230 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:12,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1902 Valid, 6230 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 00:54:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27738 states. [2021-11-17 00:54:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27738 to 17334. [2021-11-17 00:54:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17334 states, 13920 states have (on average 1.425) internal successors, (19836), 14140 states have internal predecessors, (19836), 2395 states have call successors, (2395), 991 states have call predecessors, (2395), 1018 states have return successors, (2658), 2376 states have call predecessors, (2658), 2394 states have call successors, (2658) [2021-11-17 00:54:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17334 states to 17334 states and 24889 transitions. [2021-11-17 00:54:13,334 INFO L78 Accepts]: Start accepts. Automaton has 17334 states and 24889 transitions. Word has length 195 [2021-11-17 00:54:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:13,335 INFO L470 AbstractCegarLoop]: Abstraction has 17334 states and 24889 transitions. [2021-11-17 00:54:13,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 00:54:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17334 states and 24889 transitions. [2021-11-17 00:54:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 00:54:13,349 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:13,349 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:13,367 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-17 00:54:13,565 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-17 00:54:13,565 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1477533389, now seen corresponding path program 1 times [2021-11-17 00:54:13,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:13,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471848024] [2021-11-17 00:54:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:13,566 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:13,568 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-17 00:54:13,569 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-17 00:54:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:13,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:54:13,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-17 00:54:14,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-11-17 00:54:15,602 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:15,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471848024] [2021-11-17 00:54:15,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471848024] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:15,602 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:15,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-17 00:54:15,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424241583] [2021-11-17 00:54:15,602 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:15,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:54:15,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:54:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:54:15,603 INFO L87 Difference]: Start difference. First operand 17334 states and 24889 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 00:54:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:20,743 INFO L93 Difference]: Finished difference Result 47720 states and 68287 transitions. [2021-11-17 00:54:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-17 00:54:20,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 206 [2021-11-17 00:54:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:20,846 INFO L225 Difference]: With dead ends: 47720 [2021-11-17 00:54:20,847 INFO L226 Difference]: Without dead ends: 30436 [2021-11-17 00:54:20,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:54:20,885 INFO L933 BasicCegarLoop]: 2450 mSDtfsCounter, 2641 mSDsluCounter, 12019 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 14469 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:20,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2648 Valid, 14469 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-17 00:54:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30436 states. [2021-11-17 00:54:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30436 to 17334. [2021-11-17 00:54:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17334 states, 13920 states have (on average 1.425) internal successors, (19836), 14140 states have internal predecessors, (19836), 2395 states have call successors, (2395), 991 states have call predecessors, (2395), 1018 states have return successors, (2658), 2376 states have call predecessors, (2658), 2394 states have call successors, (2658) [2021-11-17 00:54:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17334 states to 17334 states and 24889 transitions. [2021-11-17 00:54:21,510 INFO L78 Accepts]: Start accepts. Automaton has 17334 states and 24889 transitions. Word has length 206 [2021-11-17 00:54:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:21,511 INFO L470 AbstractCegarLoop]: Abstraction has 17334 states and 24889 transitions. [2021-11-17 00:54:21,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 00:54:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17334 states and 24889 transitions. [2021-11-17 00:54:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-11-17 00:54:21,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:21,628 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:21,647 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-17 00:54:21,829 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-17 00:54:21,830 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1770211080, now seen corresponding path program 1 times [2021-11-17 00:54:21,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:21,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139745689] [2021-11-17 00:54:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:21,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:21,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:21,832 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-17 00:54:21,834 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-17 00:54:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:22,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-17 00:54:22,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 00:54:23,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-11-17 00:54:25,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:25,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139745689] [2021-11-17 00:54:25,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139745689] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:25,442 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:25,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-11-17 00:54:25,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817072805] [2021-11-17 00:54:25,442 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:25,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 00:54:25,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 00:54:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:54:25,444 INFO L87 Difference]: Start difference. First operand 17334 states and 24889 transitions. Second operand has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 12 states have internal predecessors, (179), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) [2021-11-17 00:54:29,584 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:54:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:30,097 INFO L93 Difference]: Finished difference Result 38683 states and 55977 transitions. [2021-11-17 00:54:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:54:30,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 12 states have internal predecessors, (179), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) Word has length 244 [2021-11-17 00:54:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:30,151 INFO L225 Difference]: With dead ends: 38683 [2021-11-17 00:54:30,151 INFO L226 Difference]: Without dead ends: 21399 [2021-11-17 00:54:30,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:54:30,178 INFO L933 BasicCegarLoop]: 1365 mSDtfsCounter, 2580 mSDsluCounter, 10753 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 337 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 12118 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:30,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2608 Valid, 12118 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2021-11-17 00:54:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21399 states. [2021-11-17 00:54:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21399 to 17418. [2021-11-17 00:54:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17418 states, 13992 states have (on average 1.4228130360205833) internal successors, (19908), 14212 states have internal predecessors, (19908), 2395 states have call successors, (2395), 991 states have call predecessors, (2395), 1030 states have return successors, (2670), 2388 states have call predecessors, (2670), 2394 states have call successors, (2670) [2021-11-17 00:54:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17418 states to 17418 states and 24973 transitions. [2021-11-17 00:54:30,774 INFO L78 Accepts]: Start accepts. Automaton has 17418 states and 24973 transitions. Word has length 244 [2021-11-17 00:54:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:30,774 INFO L470 AbstractCegarLoop]: Abstraction has 17418 states and 24973 transitions. [2021-11-17 00:54:30,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 12 states have internal predecessors, (179), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 2 states have call successors, (38) [2021-11-17 00:54:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17418 states and 24973 transitions. [2021-11-17 00:54:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-11-17 00:54:30,787 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:30,787 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:30,810 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-17 00:54:31,004 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-17 00:54:31,005 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2099620685, now seen corresponding path program 1 times [2021-11-17 00:54:31,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:31,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377683102] [2021-11-17 00:54:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:31,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:31,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:31,007 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-17 00:54:31,009 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-17 00:54:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:31,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-17 00:54:31,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 00:54:32,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-11-17 00:54:33,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:33,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377683102] [2021-11-17 00:54:33,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377683102] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:33,418 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:33,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-17 00:54:33,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108569202] [2021-11-17 00:54:33,418 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:33,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:54:33,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:54:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:54:33,420 INFO L87 Difference]: Start difference. First operand 17418 states and 24973 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 00:54:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:34,328 INFO L93 Difference]: Finished difference Result 39989 states and 58161 transitions. [2021-11-17 00:54:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:54:34,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 250 [2021-11-17 00:54:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:34,393 INFO L225 Difference]: With dead ends: 39989 [2021-11-17 00:54:34,393 INFO L226 Difference]: Without dead ends: 22621 [2021-11-17 00:54:34,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:54:34,423 INFO L933 BasicCegarLoop]: 1388 mSDtfsCounter, 280 mSDsluCounter, 5219 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 6607 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:34,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 6607 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:54:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22621 states. [2021-11-17 00:54:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22621 to 17490. [2021-11-17 00:54:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17490 states, 14052 states have (on average 1.4210076857386849) internal successors, (19968), 14272 states have internal predecessors, (19968), 2395 states have call successors, (2395), 991 states have call predecessors, (2395), 1042 states have return successors, (2706), 2400 states have call predecessors, (2706), 2394 states have call successors, (2706) [2021-11-17 00:54:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17490 states to 17490 states and 25069 transitions. [2021-11-17 00:54:35,040 INFO L78 Accepts]: Start accepts. Automaton has 17490 states and 25069 transitions. Word has length 250 [2021-11-17 00:54:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:35,041 INFO L470 AbstractCegarLoop]: Abstraction has 17490 states and 25069 transitions. [2021-11-17 00:54:35,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 00:54:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17490 states and 25069 transitions. [2021-11-17 00:54:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-11-17 00:54:35,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:35,055 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:35,081 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-17 00:54:35,267 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-17 00:54:35,268 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 288206022, now seen corresponding path program 1 times [2021-11-17 00:54:35,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:35,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709386749] [2021-11-17 00:54:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:35,269 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:35,270 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-17 00:54:35,271 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-17 00:54:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-17 00:54:35,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 65 proven. 14 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-11-17 00:54:39,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-11-17 00:54:41,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:41,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709386749] [2021-11-17 00:54:41,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709386749] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:54:41,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:54:41,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-11-17 00:54:41,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005929907] [2021-11-17 00:54:41,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:54:41,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 00:54:41,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 00:54:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:54:41,624 INFO L87 Difference]: Start difference. First operand 17490 states and 25069 transitions. Second operand has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 11 states have internal predecessors, (235), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 8 states have call predecessors, (47), 6 states have call successors, (47) [2021-11-17 00:54:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:44,721 INFO L93 Difference]: Finished difference Result 50978 states and 75601 transitions. [2021-11-17 00:54:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:54:44,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 11 states have internal predecessors, (235), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 8 states have call predecessors, (47), 6 states have call successors, (47) Word has length 251 [2021-11-17 00:54:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:44,820 INFO L225 Difference]: With dead ends: 50978 [2021-11-17 00:54:44,820 INFO L226 Difference]: Without dead ends: 33538 [2021-11-17 00:54:44,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:54:44,866 INFO L933 BasicCegarLoop]: 1743 mSDtfsCounter, 2964 mSDsluCounter, 11870 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 13613 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:44,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3061 Valid, 13613 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-17 00:54:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33538 states. [2021-11-17 00:54:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33538 to 24980. [2021-11-17 00:54:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24980 states, 20467 states have (on average 1.4434455464894709) internal successors, (29543), 20729 states have internal predecessors, (29543), 3469 states have call successors, (3469), 991 states have call predecessors, (3469), 1043 states have return successors, (3919), 3493 states have call predecessors, (3919), 3468 states have call successors, (3919) [2021-11-17 00:54:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24980 states to 24980 states and 36931 transitions. [2021-11-17 00:54:45,853 INFO L78 Accepts]: Start accepts. Automaton has 24980 states and 36931 transitions. Word has length 251 [2021-11-17 00:54:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:45,854 INFO L470 AbstractCegarLoop]: Abstraction has 24980 states and 36931 transitions. [2021-11-17 00:54:45,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 11 states have internal predecessors, (235), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 8 states have call predecessors, (47), 6 states have call successors, (47) [2021-11-17 00:54:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24980 states and 36931 transitions. [2021-11-17 00:54:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-11-17 00:54:45,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:45,873 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:45,903 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-17 00:54:46,087 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-17 00:54:46,088 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1549123272, now seen corresponding path program 1 times [2021-11-17 00:54:46,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:46,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858553874] [2021-11-17 00:54:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:46,089 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:46,091 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-17 00:54:46,094 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-17 00:54:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:46,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:54:46,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-11-17 00:54:47,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-11-17 00:54:48,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:48,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858553874] [2021-11-17 00:54:48,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858553874] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:48,521 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:48,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-17 00:54:48,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260126591] [2021-11-17 00:54:48,521 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:48,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:54:48,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:48,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:54:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:54:48,523 INFO L87 Difference]: Start difference. First operand 24980 states and 36931 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:54:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:49,472 INFO L93 Difference]: Finished difference Result 49964 states and 73953 transitions. [2021-11-17 00:54:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:54:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 251 [2021-11-17 00:54:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:49,556 INFO L225 Difference]: With dead ends: 49964 [2021-11-17 00:54:49,556 INFO L226 Difference]: Without dead ends: 25064 [2021-11-17 00:54:49,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:54:49,615 INFO L933 BasicCegarLoop]: 1021 mSDtfsCounter, 2 mSDsluCounter, 3058 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:49,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4079 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:54:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25064 states. [2021-11-17 00:54:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25064 to 25028. [2021-11-17 00:54:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25028 states, 20503 states have (on average 1.4426669267912013) internal successors, (29579), 20765 states have internal predecessors, (29579), 3469 states have call successors, (3469), 991 states have call predecessors, (3469), 1055 states have return successors, (3937), 3505 states have call predecessors, (3937), 3468 states have call successors, (3937) [2021-11-17 00:54:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25028 states to 25028 states and 36985 transitions. [2021-11-17 00:54:50,523 INFO L78 Accepts]: Start accepts. Automaton has 25028 states and 36985 transitions. Word has length 251 [2021-11-17 00:54:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:50,524 INFO L470 AbstractCegarLoop]: Abstraction has 25028 states and 36985 transitions. [2021-11-17 00:54:50,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 00:54:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 25028 states and 36985 transitions. [2021-11-17 00:54:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-11-17 00:54:50,543 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:50,543 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:54:50,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:50,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:50,744 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -891123153, now seen corresponding path program 1 times [2021-11-17 00:54:50,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:50,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854651511] [2021-11-17 00:54:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:50,745 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:50,746 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:50,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-17 00:54:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:51,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-17 00:54:51,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-11-17 00:54:56,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2021-11-17 00:55:00,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:00,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854651511] [2021-11-17 00:55:00,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854651511] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:55:00,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:55:00,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2021-11-17 00:55:00,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726866067] [2021-11-17 00:55:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:00,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 00:55:00,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 00:55:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-11-17 00:55:00,192 INFO L87 Difference]: Start difference. First operand 25028 states and 36985 transitions. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-17 00:55:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:04,651 INFO L93 Difference]: Finished difference Result 89789 states and 137199 transitions. [2021-11-17 00:55:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 00:55:04,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 3 states have call successors, (27) Word has length 258 [2021-11-17 00:55:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:04,881 INFO L225 Difference]: With dead ends: 89789 [2021-11-17 00:55:04,881 INFO L226 Difference]: Without dead ends: 64841 [2021-11-17 00:55:04,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2021-11-17 00:55:04,959 INFO L933 BasicCegarLoop]: 1747 mSDtfsCounter, 1521 mSDsluCounter, 15247 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 16994 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:04,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1635 Valid, 16994 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-17 00:55:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64841 states. [2021-11-17 00:55:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64841 to 25160. [2021-11-17 00:55:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25160 states, 20623 states have (on average 1.4395092857489211) internal successors, (29687), 20861 states have internal predecessors, (29687), 3469 states have call successors, (3469), 991 states have call predecessors, (3469), 1067 states have return successors, (3973), 3541 states have call predecessors, (3973), 3468 states have call successors, (3973) [2021-11-17 00:55:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25160 states to 25160 states and 37129 transitions. [2021-11-17 00:55:06,305 INFO L78 Accepts]: Start accepts. Automaton has 25160 states and 37129 transitions. Word has length 258 [2021-11-17 00:55:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:06,306 INFO L470 AbstractCegarLoop]: Abstraction has 25160 states and 37129 transitions. [2021-11-17 00:55:06,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-17 00:55:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 25160 states and 37129 transitions. [2021-11-17 00:55:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-11-17 00:55:06,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:06,324 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 11, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:55:06,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-17 00:55:06,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:06,540 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash -38078901, now seen corresponding path program 1 times [2021-11-17 00:55:06,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:06,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754071234] [2021-11-17 00:55:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:06,541 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:06,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:06,542 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:06,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-17 00:55:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:07,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 00:55:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2021-11-17 00:55:08,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-11-17 00:55:08,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:08,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754071234] [2021-11-17 00:55:08,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754071234] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:08,889 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:08,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-17 00:55:08,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967429028] [2021-11-17 00:55:08,889 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:08,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:55:08,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:55:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:55:08,890 INFO L87 Difference]: Start difference. First operand 25160 states and 37129 transitions. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 00:55:12,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:55:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:16,550 INFO L93 Difference]: Finished difference Result 61423 states and 92385 transitions. [2021-11-17 00:55:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:55:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 273 [2021-11-17 00:55:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:16,645 INFO L225 Difference]: With dead ends: 61423 [2021-11-17 00:55:16,645 INFO L226 Difference]: Without dead ends: 36343 [2021-11-17 00:55:16,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:55:16,688 INFO L933 BasicCegarLoop]: 1350 mSDtfsCounter, 628 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 3868 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:16,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 3868 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 356 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2021-11-17 00:55:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36343 states. [2021-11-17 00:55:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36343 to 26420. [2021-11-17 00:55:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26420 states, 21883 states have (on average 1.4465566878398757) internal successors, (31655), 22121 states have internal predecessors, (31655), 3469 states have call successors, (3469), 991 states have call predecessors, (3469), 1067 states have return successors, (3973), 3541 states have call predecessors, (3973), 3468 states have call successors, (3973) [2021-11-17 00:55:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26420 states to 26420 states and 39097 transitions. [2021-11-17 00:55:17,722 INFO L78 Accepts]: Start accepts. Automaton has 26420 states and 39097 transitions. Word has length 273 [2021-11-17 00:55:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:17,723 INFO L470 AbstractCegarLoop]: Abstraction has 26420 states and 39097 transitions. [2021-11-17 00:55:17,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 00:55:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 26420 states and 39097 transitions. [2021-11-17 00:55:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-11-17 00:55:17,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:17,740 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:55:17,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-17 00:55:17,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:17,943 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2016070500, now seen corresponding path program 1 times [2021-11-17 00:55:17,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:17,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120424359] [2021-11-17 00:55:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:17,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:17,945 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:18,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-17 00:55:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:18,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:55:18,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 120 proven. 39 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-17 00:55:21,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-11-17 00:55:22,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:22,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120424359] [2021-11-17 00:55:22,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120424359] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:55:22,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:55:22,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-17 00:55:22,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302102883] [2021-11-17 00:55:22,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:55:22,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:55:22,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:55:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:55:22,696 INFO L87 Difference]: Start difference. First operand 26420 states and 39097 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 6 states have call successors, (45), 4 states have call predecessors, (45), 3 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2021-11-17 00:55:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:35,174 INFO L93 Difference]: Finished difference Result 119557 states and 175927 transitions. [2021-11-17 00:55:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:55:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 6 states have call successors, (45), 4 states have call predecessors, (45), 3 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 266 [2021-11-17 00:55:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:35,565 INFO L225 Difference]: With dead ends: 119557 [2021-11-17 00:55:35,566 INFO L226 Difference]: Without dead ends: 119548 [2021-11-17 00:55:35,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:55:35,617 INFO L933 BasicCegarLoop]: 2133 mSDtfsCounter, 5451 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5451 SdHoareTripleChecker+Valid, 5589 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:35,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5451 Valid, 5589 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2021-11-17 00:55:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119548 states. [2021-11-17 00:55:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119548 to 109969. [2021-11-17 00:55:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109969 states, 90840 states have (on average 1.4379788639365918) internal successors, (130626), 91881 states have internal predecessors, (130626), 14532 states have call successors, (14532), 4259 states have call predecessors, (14532), 4596 states have return successors, (16691), 14837 states have call predecessors, (16691), 14531 states have call successors, (16691) [2021-11-17 00:55:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109969 states to 109969 states and 161849 transitions. [2021-11-17 00:55:41,187 INFO L78 Accepts]: Start accepts. Automaton has 109969 states and 161849 transitions. Word has length 266 [2021-11-17 00:55:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:41,188 INFO L470 AbstractCegarLoop]: Abstraction has 109969 states and 161849 transitions. [2021-11-17 00:55:41,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 6 states have call successors, (45), 4 states have call predecessors, (45), 3 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2021-11-17 00:55:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 109969 states and 161849 transitions. [2021-11-17 00:55:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2021-11-17 00:55:41,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:41,350 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:55:41,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-17 00:55:41,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:41,555 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1063164316, now seen corresponding path program 1 times [2021-11-17 00:55:41,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:41,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355051781] [2021-11-17 00:55:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:41,556 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:41,557 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:41,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-17 00:55:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:42,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:55:42,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2021-11-17 00:55:44,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-11-17 00:55:45,752 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:45,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355051781] [2021-11-17 00:55:45,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355051781] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:45,752 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:45,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:55:45,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839281307] [2021-11-17 00:55:45,757 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:45,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:55:45,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:55:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:55:45,758 INFO L87 Difference]: Start difference. First operand 109969 states and 161849 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 4 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2021-11-17 00:55:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:49,035 INFO L93 Difference]: Finished difference Result 167051 states and 246068 transitions. [2021-11-17 00:55:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:55:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 4 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 270 [2021-11-17 00:55:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:49,195 INFO L225 Difference]: With dead ends: 167051 [2021-11-17 00:55:49,195 INFO L226 Difference]: Without dead ends: 52037 [2021-11-17 00:55:49,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 536 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-17 00:55:49,534 INFO L933 BasicCegarLoop]: 1045 mSDtfsCounter, 895 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:49,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [895 Valid, 1112 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 00:55:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52037 states. [2021-11-17 00:55:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52037 to 51726. [2021-11-17 00:55:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51726 states, 42746 states have (on average 1.4277827165114865) internal successors, (61032), 43223 states have internal predecessors, (61032), 6788 states have call successors, (6788), 2024 states have call predecessors, (6788), 2191 states have return successors, (7827), 6969 states have call predecessors, (7827), 6787 states have call successors, (7827) [2021-11-17 00:55:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51726 states to 51726 states and 75647 transitions. [2021-11-17 00:55:52,066 INFO L78 Accepts]: Start accepts. Automaton has 51726 states and 75647 transitions. Word has length 270 [2021-11-17 00:55:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:52,067 INFO L470 AbstractCegarLoop]: Abstraction has 51726 states and 75647 transitions. [2021-11-17 00:55:52,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 4 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2021-11-17 00:55:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51726 states and 75647 transitions. [2021-11-17 00:55:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-11-17 00:55:52,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:52,087 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 11, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:55:52,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-17 00:55:52,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:52,303 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:52,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1724835237, now seen corresponding path program 1 times [2021-11-17 00:55:52,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:52,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880891246] [2021-11-17 00:55:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:52,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:52,305 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:52,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-17 00:55:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:52,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-17 00:55:52,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 94 proven. 14 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-11-17 00:55:56,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:56:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-17 00:56:00,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:56:00,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880891246] [2021-11-17 00:56:00,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880891246] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:56:00,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:56:00,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-11-17 00:56:00,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508330221] [2021-11-17 00:56:00,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:56:00,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-17 00:56:00,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:56:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-17 00:56:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-17 00:56:00,070 INFO L87 Difference]: Start difference. First operand 51726 states and 75647 transitions. Second operand has 17 states, 17 states have (on average 16.11764705882353) internal successors, (274), 15 states have internal predecessors, (274), 8 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 10 states have call predecessors, (53), 8 states have call successors, (53) [2021-11-17 00:56:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:56:05,177 INFO L93 Difference]: Finished difference Result 105970 states and 155432 transitions. [2021-11-17 00:56:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:56:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.11764705882353) internal successors, (274), 15 states have internal predecessors, (274), 8 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 10 states have call predecessors, (53), 8 states have call successors, (53) Word has length 290 [2021-11-17 00:56:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:56:05,352 INFO L225 Difference]: With dead ends: 105970 [2021-11-17 00:56:05,352 INFO L226 Difference]: Without dead ends: 67446 [2021-11-17 00:56:05,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-17 00:56:05,421 INFO L933 BasicCegarLoop]: 2320 mSDtfsCounter, 1886 mSDsluCounter, 21653 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 23973 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:56:05,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1922 Valid, 23973 Invalid, 559 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [388 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 00:56:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67446 states. [2021-11-17 00:56:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67446 to 54342. [2021-11-17 00:56:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54342 states, 45122 states have (on average 1.4329152076592349) internal successors, (64656), 45599 states have internal predecessors, (64656), 7028 states have call successors, (7028), 2024 states have call predecessors, (7028), 2191 states have return successors, (8115), 7233 states have call predecessors, (8115), 7027 states have call successors, (8115) [2021-11-17 00:56:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54342 states to 54342 states and 79799 transitions. [2021-11-17 00:56:08,123 INFO L78 Accepts]: Start accepts. Automaton has 54342 states and 79799 transitions. Word has length 290 [2021-11-17 00:56:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:56:08,124 INFO L470 AbstractCegarLoop]: Abstraction has 54342 states and 79799 transitions. [2021-11-17 00:56:08,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.11764705882353) internal successors, (274), 15 states have internal predecessors, (274), 8 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 10 states have call predecessors, (53), 8 states have call successors, (53) [2021-11-17 00:56:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54342 states and 79799 transitions. [2021-11-17 00:56:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-17 00:56:08,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:56:08,143 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:56:08,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:08,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:56:08,344 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:56:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:56:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash -80503256, now seen corresponding path program 2 times [2021-11-17 00:56:08,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:56:08,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021253664] [2021-11-17 00:56:08,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:56:08,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:56:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:56:08,346 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:56:08,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-17 00:56:08,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 00:56:08,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:56:08,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 00:56:08,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:56:11,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-17 00:56:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 00:56:12,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2021-11-17 00:56:12,857 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 29 treesize of output 6 [2021-11-17 00:56:14,033 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-17 00:56:14,034 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 26 treesize of output 38 [2021-11-17 00:56:14,108 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 16 treesize of output 1 [2021-11-17 00:56:21,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2021-11-17 00:56:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2021-11-17 00:56:22,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:56:25,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ppp_async_input_~ap#1.base| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 32)) (|ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ BitVec 64))) (let ((.cse0 (select (store |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base| (store (select |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base|) (bvadd |ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ bv250 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|))) (or (= (select .cse0 (bvadd (_ bv104 64) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.offset|)) (_ bv0 32)) (= (select .cse0 (bvadd (_ bv108 64) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.offset|)) (_ bv0 32))))) is different from false [2021-11-17 00:56:27,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ppp_async_input_~ap#1.base| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 32)) (|ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ BitVec 64))) (let ((.cse0 (select (store |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base| (store (select |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base|) (bvadd |ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ bv250 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.base|))) (or (= (select .cse0 (bvadd |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.offset| (_ bv108 64))) (_ bv0 32)) (= (select .cse0 (bvadd (_ bv104 64) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.offset|)) (_ bv0 32))))) is different from false [2021-11-17 00:56:29,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ppp_async_input_~ap#1.base| (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 32)) (|ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ BitVec 64))) (let ((.cse0 (select (store |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base| (store (select |c_#memory_int| |ULTIMATE.start_ppp_async_input_~ap#1.base|) (bvadd |ULTIMATE.start_ppp_async_input_~ap#1.offset| (_ bv250 64)) v_DerPreprocessor_2)) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret378#1.base|))) (or (= (select .cse0 (bvadd (_ bv104 64) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret378#1.offset|)) (_ bv0 32)) (= (select .cse0 (bvadd |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret378#1.offset| (_ bv108 64))) (_ bv0 32))))) is different from false [2021-11-17 00:56:30,829 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:56:30,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021253664] [2021-11-17 00:56:30,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (ite Bool (_ BitVec 32) (Array (_ BitVec 64) (_ BitVec 32))) [2021-11-17 00:56:30,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [961966576] [2021-11-17 00:56:30,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:56:30,830 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-17 00:56:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-17 00:56:30,832 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-17 00:56:30,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2021-11-17 00:56:31,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 00:56:31,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:56:31,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 00:56:31,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:56:34,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2de99e73 [2021-11-17 00:56:34,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552016798] [2021-11-17 00:56:34,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:56:34,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:56:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:56:34,696 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:56:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-17 00:56:35,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 00:56:35,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:56:35,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 00:56:35,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:56:37,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2de99e73 [2021-11-17 00:56:37,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:56:37,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-17 00:56:37,863 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-11-17 00:56:37,863 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-17 00:56:37,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-17 00:56:37,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:38,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-11-17 00:56:38,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:38,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:56:38,474 INFO L732 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-17 00:56:38,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-17 00:56:38,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:56:38 BoogieIcfgContainer [2021-11-17 00:56:38,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-17 00:56:38,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-17 00:56:38,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-17 00:56:38,530 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-17 00:56:38,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:53:21" (3/4) ... [2021-11-17 00:56:38,532 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-17 00:56:38,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-17 00:56:38,532 INFO L158 Benchmark]: Toolchain (without parser) took 204800.31ms. Allocated memory was 56.6MB in the beginning and 7.4GB in the end (delta: 7.4GB). Free memory was 25.3MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2021-11-17 00:56:38,532 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1250.74ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 25.1MB in the beginning and 82.1MB in the end (delta: -57.0MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.01ms. Allocated memory is still 130.0MB. Free memory was 82.1MB in the beginning and 69.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: Boogie Preprocessor took 125.59ms. Allocated memory is still 130.0MB. Free memory was 69.5MB in the beginning and 55.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: RCFGBuilder took 5972.33ms. Allocated memory was 130.0MB in the beginning and 222.3MB in the end (delta: 92.3MB). Free memory was 55.6MB in the beginning and 125.8MB in the end (delta: -70.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: TraceAbstraction took 197314.55ms. Allocated memory was 222.3MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 124.8MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2021-11-17 00:56:38,533 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 7.4GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-17 00:56:38,534 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.15ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1250.74ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 25.1MB in the beginning and 82.1MB in the end (delta: -57.0MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.01ms. Allocated memory is still 130.0MB. Free memory was 82.1MB in the beginning and 69.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.59ms. Allocated memory is still 130.0MB. Free memory was 69.5MB in the beginning and 55.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 5972.33ms. Allocated memory was 130.0MB in the beginning and 222.3MB in the end (delta: 92.3MB). Free memory was 55.6MB in the beginning and 125.8MB in the end (delta: -70.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * TraceAbstraction took 197314.55ms. Allocated memory was 222.3MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 124.8MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 7.4GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 5666]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 5796. Possible FailurePath: [L5689] int LDV_IN_INTERRUPT = 1; [L5690] struct ppp_channel *async_ops_group0 ; [L5691] int ldv_state_variable_2 ; [L5692] int ref_cnt ; [L5693] int ldv_state_variable_1 ; [L5694] struct tty_struct *ppp_ldisc_group1 ; [L5695] int ldv_state_variable_0 ; [L5785] static int flag_time = 250; [L5795] static struct ppp_channel_ops const async_ops = {& ppp_async_send, & ppp_async_ioctl}; [L5796-L5797] static rwlock_t disc_data_lock = {{{0}, {{0U}}}, 3736018669U, 4294967295U, (void *)-1, {0, {0, 0}, "disc_data_lock", 0, 0UL}}; [L6120-L6123] static struct tty_ldisc_ops ppp_ldisc = {21507, (char *)"ppp", 0, 0, & ppp_asynctty_open, & ppp_asynctty_close, 0, 0, & ppp_asynctty_read, & ppp_asynctty_write, & ppp_asynctty_ioctl, 0, 0, & ppp_asynctty_poll, & ppp_asynctty_hangup, & ppp_asynctty_receive, & ppp_asynctty_wakeup, 0, 0, 0, & __this_module, 0}; [L7053] int ldv_retval_0 ; [L7054] int ldv_retval_1 ; [L7414] Element set_impl[15] ; [L7415] int last_index = 0; [L7549] Set LDV_SKBS ; [L7077] size_t ldvarg11 ; [L7078] size_t tmp ; [L7079] struct file *ldvarg7 ; [L7080] void *tmp___0 ; [L7081] int ldvarg3 ; [L7082] int tmp___1 ; [L7083] unsigned long ldvarg0 ; [L7084] unsigned long tmp___2 ; [L7085] unsigned char *ldvarg12 ; [L7086] void *tmp___3 ; [L7087] unsigned char *ldvarg5 ; [L7088] void *tmp___4 ; [L7089] struct poll_table_struct *ldvarg6 ; [L7090] void *tmp___5 ; [L7091] size_t ldvarg8 ; [L7092] size_t tmp___6 ; [L7093] unsigned int ldvarg1 ; [L7094] unsigned int tmp___7 ; [L7095] char *ldvarg4 ; [L7096] void *tmp___8 ; [L7097] struct file *ldvarg13 ; [L7098] void *tmp___9 ; [L7099] struct file *ldvarg10 ; [L7100] void *tmp___10 ; [L7101] unsigned char *ldvarg9 ; [L7102] void *tmp___11 ; [L7103] struct file *ldvarg2 ; [L7104] void *tmp___12 ; [L7105] unsigned long ldvarg14 ; [L7106] unsigned long tmp___13 ; [L7107] struct sk_buff *ldvarg16 ; [L7108] void *tmp___14 ; [L7109] unsigned int ldvarg15 ; [L7110] unsigned int tmp___15 ; [L7111] int tmp___16 ; [L7112] int tmp___17 ; [L7113] int tmp___18 ; [L7114] int tmp___19 ; [L7116] tmp = __VERIFIER_nondet_size_t() [L7117] ldvarg11 = tmp [L7118] CALL, EXPR ldv_zalloc(512UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7118] RET, EXPR ldv_zalloc(512UL) [L7118] tmp___0 = ldv_zalloc(512UL) [L7119] ldvarg7 = (struct file *)tmp___0 [L7120] tmp___1 = __VERIFIER_nondet_int() [L7121] ldvarg3 = tmp___1 [L7122] tmp___2 = __VERIFIER_nondet_ulong() [L7123] ldvarg0 = tmp___2 [L7124] CALL, EXPR ldv_zalloc(1UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7124] RET, EXPR ldv_zalloc(1UL) [L7124] tmp___3 = ldv_zalloc(1UL) [L7125] ldvarg12 = (unsigned char *)tmp___3 [L7126] CALL, EXPR ldv_zalloc(1UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7126] RET, EXPR ldv_zalloc(1UL) [L7126] tmp___4 = ldv_zalloc(1UL) [L7127] ldvarg5 = (unsigned char *)tmp___4 [L7128] CALL, EXPR ldv_zalloc(16UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7128] RET, EXPR ldv_zalloc(16UL) [L7128] tmp___5 = ldv_zalloc(16UL) [L7129] ldvarg6 = (struct poll_table_struct *)tmp___5 [L7130] tmp___6 = __VERIFIER_nondet_size_t() [L7131] ldvarg8 = tmp___6 [L7132] tmp___7 = __VERIFIER_nondet_uint() [L7133] ldvarg1 = tmp___7 [L7134] CALL, EXPR ldv_zalloc(1UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7134] RET, EXPR ldv_zalloc(1UL) [L7134] tmp___8 = ldv_zalloc(1UL) [L7135] ldvarg4 = (char *)tmp___8 [L7136] CALL, EXPR ldv_zalloc(512UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7136] RET, EXPR ldv_zalloc(512UL) [L7136] tmp___9 = ldv_zalloc(512UL) [L7137] ldvarg13 = (struct file *)tmp___9 [L7138] CALL, EXPR ldv_zalloc(512UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7138] RET, EXPR ldv_zalloc(512UL) [L7138] tmp___10 = ldv_zalloc(512UL) [L7139] ldvarg10 = (struct file *)tmp___10 [L7140] CALL, EXPR ldv_zalloc(1UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7140] RET, EXPR ldv_zalloc(1UL) [L7140] tmp___11 = ldv_zalloc(1UL) [L7141] ldvarg9 = (unsigned char *)tmp___11 [L7142] CALL, EXPR ldv_zalloc(512UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7142] RET, EXPR ldv_zalloc(512UL) [L7142] tmp___12 = ldv_zalloc(512UL) [L7143] ldvarg2 = (struct file *)tmp___12 [L7144] tmp___13 = __VERIFIER_nondet_ulong() [L7145] ldvarg14 = tmp___13 [L7146] CALL, EXPR ldv_zalloc(232UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7146] RET, EXPR ldv_zalloc(232UL) [L7146] tmp___14 = ldv_zalloc(232UL) [L7147] ldvarg16 = (struct sk_buff *)tmp___14 [L7148] tmp___15 = __VERIFIER_nondet_uint() [L7149] ldvarg15 = tmp___15 [L7150] CALL ldv_initialize() [L7568] CALL ldv_set_init(LDV_SKBS) [L7420] set = set_impl [L7421] last_index = 0 [L7568] RET ldv_set_init(LDV_SKBS) [L7150] RET ldv_initialize() [L7151] ldv_state_variable_1 = 0 [L7152] ref_cnt = 0 [L7153] ldv_state_variable_0 = 1 [L7154] ldv_state_variable_2 = 0 [L7156] tmp___16 = __VERIFIER_nondet_int() [L7158] case 0: [L7254] case 1: [L7255] COND TRUE ldv_state_variable_0 != 0 [L7256] tmp___18 = __VERIFIER_nondet_int() [L7258] case 0: [L7266] case 1: [L7267] COND TRUE ldv_state_variable_0 == 1 [L7268] CALL, EXPR ppp_async_init() [L6126] int err ; [L6128] CALL, EXPR tty_register_ldisc(3, & ppp_ldisc) [L7759] return __VERIFIER_nondet_int(); [L6128] RET, EXPR tty_register_ldisc(3, & ppp_ldisc) [L6128] err = tty_register_ldisc(3, & ppp_ldisc) [L6129] COND FALSE !(err != 0) [L6133] return (err); [L7268] RET, EXPR ppp_async_init() [L7268] ldv_retval_1 = ppp_async_init() [L7269] COND TRUE ldv_retval_1 == 0 [L7270] ldv_state_variable_0 = 3 [L7271] ldv_state_variable_2 = 1 [L7272] CALL ldv_initialize_ppp_channel_ops_2() [L7059] void *tmp ; [L7061] CALL, EXPR ldv_zalloc(40UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7061] RET, EXPR ldv_zalloc(40UL) [L7061] tmp = ldv_zalloc(40UL) [L7062] async_ops_group0 = (struct ppp_channel *)tmp [L7272] RET ldv_initialize_ppp_channel_ops_2() [L7273] ldv_state_variable_1 = 1 [L7274] CALL ldv_target_type_1() [L7068] void *tmp ; [L7070] CALL, EXPR ldv_zalloc(1752UL) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND TRUE tmp___0 != 0 [L5637] return ((void *)0); [L7070] RET, EXPR ldv_zalloc(1752UL) [L7070] tmp = ldv_zalloc(1752UL) [L7071] ppp_ldisc_group1 = (struct tty_struct *)tmp [L7274] RET ldv_target_type_1() [L7277] COND FALSE !(ldv_retval_1 != 0) [L7156] tmp___16 = __VERIFIER_nondet_int() [L7158] case 0: [L7159] COND TRUE ldv_state_variable_1 != 0 [L7160] tmp___17 = __VERIFIER_nondet_int() [L7162] case 0: [L7170] case 1: [L7177] case 2: [L7189] case 3: [L7201] case 4: [L7209] case 5: [L7210] COND TRUE ldv_state_variable_1 == 1 [L7211] CALL, EXPR ppp_asynctty_open(ppp_ldisc_group1) [L5826] struct asyncppp *ap ; [L5827] int err ; [L5828] int speed ; [L5829] void *tmp ; [L5830] struct lock_class_key __key ; [L5831] struct lock_class_key __key___0 ; [L5832] speed_t tmp___0 ; [L5834] EXPR tty->ops [L5834] EXPR (tty->ops)->write [L5834-L5836] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5840] err = -12 [L5841] CALL, EXPR kzalloc(4656UL, 208U) [L5469] void *tmp ; [L5471] CALL, EXPR kmalloc(size, flags | 32768U) [L5460] void *tmp___2 ; [L5462] CALL, EXPR __kmalloc(size, flags) [L5455] CALL, EXPR ldv_malloc(size) [L5614] void *p ; [L5615] void *tmp ; [L5616] int tmp___0 ; [L5618] tmp___0 = __VERIFIER_nondet_int() [L5619] COND FALSE !(tmp___0 != 0) [L5622] tmp = malloc(size) [L5623] p = tmp [L5624] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5610] COND FALSE !(!cond) [L5624] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5625] return (p); [L5455] RET, EXPR ldv_malloc(size) [L5455] return ldv_malloc(size); [L5462] RET, EXPR __kmalloc(size, flags) [L5462] tmp___2 = __kmalloc(size, flags) [L5463] return (tmp___2); [L5471] RET, EXPR kmalloc(size, flags | 32768U) [L5471] tmp = kmalloc(size, flags | 32768U) [L5472] return (tmp); [L5841] RET, EXPR kzalloc(4656UL, 208U) [L5841] tmp = kzalloc(4656UL, 208U) [L5842] ap = (struct asyncppp *)tmp [L5843] COND FALSE !((unsigned long )ap == (unsigned long )((struct asyncppp *)0)) [L5847] ap->tty = tty [L5848] ap->mru = 1500 [L5849] CALL spinlock_check(& ap->xmit_lock) [L5412] return (& lock->ldv_6338.rlock); [L5849] RET spinlock_check(& ap->xmit_lock) [L5850-L5851] FCALL __raw_spin_lock_init(& ap->xmit_lock.ldv_6338.rlock, "&(&ap->xmit_lock)->rlock", & __key) [L5852] CALL spinlock_check(& ap->recv_lock) [L5412] return (& lock->ldv_6338.rlock); [L5852] RET spinlock_check(& ap->recv_lock) [L5853-L5854] FCALL __raw_spin_lock_init(& ap->recv_lock.ldv_6338.rlock, "&(&ap->recv_lock)->rlock", & __key___0) [L5855] ap->xaccm[0] = 4294967295U [L5856] ap->xaccm[3] = 1610612736U [L5857] ap->raccm = 4294967295U [L5858] ap->optr = (unsigned char *)(& ap->obuf) [L5859] ap->olim = (unsigned char *)(& ap->obuf) [L5860] ap->lcp_fcs = -1 [L5861] CALL skb_queue_head_init(& ap->rqueue) [L5556] struct lock_class_key __key ; [L5558] CALL spinlock_check(& list->lock) [L5412] return (& lock->ldv_6338.rlock); [L5558] RET spinlock_check(& list->lock) [L5559] FCALL __raw_spin_lock_init(& list->lock.ldv_6338.rlock, "&(&list->lock)->rlock", & __key) [L5560] CALL __skb_queue_head_init(list) [L5545] struct sk_buff *tmp ; [L5547] tmp = (struct sk_buff *)list [L5548] list->next = tmp [L5549] list->prev = tmp [L5550] list->qlen = 0U [L5560] RET __skb_queue_head_init(list) [L5561] return; [L5861] RET skb_queue_head_init(& ap->rqueue) [L5862] FCALL tasklet_init(& ap->tsk, & ppp_async_process, (unsigned long )ap) [L5863] CALL atomic_set(& ap->refcnt, 1) [L5376] v->counter = i [L5863] RET atomic_set(& ap->refcnt, 1) [L5864] CALL sema_init(& ap->dead_sem, 0) [L5700] struct lock_class_key __key ; [L5701] struct semaphore __constr_expr_0 ; [L5703] __constr_expr_0.lock.raw_lock.ldv_1452.head_tail = 0U [L5704] __constr_expr_0.lock.magic = 3735899821U [L5705] __constr_expr_0.lock.owner_cpu = 4294967295U [L5706] __constr_expr_0.lock.owner = (void *)-1 [L5707] __constr_expr_0.lock.dep_map.key = 0 [L5708] __constr_expr_0.lock.dep_map.class_cache[0] = 0 [L5709] __constr_expr_0.lock.dep_map.class_cache[1] = 0 [L5710] __constr_expr_0.lock.dep_map.name = "(*sem).lock" [L5711] __constr_expr_0.lock.dep_map.cpu = 0 [L5712] __constr_expr_0.lock.dep_map.ip = 0UL [L5713] __constr_expr_0.count = (unsigned int )val [L5714] __constr_expr_0.wait_list.next = & sem->wait_list [L5715] __constr_expr_0.wait_list.prev = & sem->wait_list [L5716] *sem = __constr_expr_0 [L5717] FCALL lockdep_init_map(& sem->lock.dep_map, "semaphore->lock", & __key, 0) [L5718] return; [L5718] return; [L5864] RET sema_init(& ap->dead_sem, 0) [L5865] ap->chan.private = (void *)ap [L5866] ap->chan.ops = & async_ops [L5867] ap->chan.mtu = 1500 [L5868] CALL, EXPR tty_get_baud_rate(tty) [L5729] speed_t tmp ; [L5731] CALL, EXPR tty_termios_baud_rate(& tty->termios) [L7763] return __VERIFIER_nondet_uint(); [L5731] RET, EXPR tty_termios_baud_rate(& tty->termios) [L5731] tmp = tty_termios_baud_rate(& tty->termios) [L5732] return (tmp); [L5868] RET, EXPR tty_get_baud_rate(tty) [L5868] tmp___0 = tty_get_baud_rate(tty) [L5869] speed = (int )tmp___0 [L5870] ap->chan.speed = speed [L5871] CALL, EXPR ppp_register_channel(& ap->chan) [L7708] return __VERIFIER_nondet_int(); [L5871] RET, EXPR ppp_register_channel(& ap->chan) [L5871] err = ppp_register_channel(& ap->chan) [L5872] COND FALSE !(err != 0) [L5876] tty->disc_data = (void *)ap [L5877] tty->receive_room = 65536U [L5878] return (0); [L5878] return (0); [L5878] return (0); [L7211] RET, EXPR ppp_asynctty_open(ppp_ldisc_group1) [L7211] ldv_retval_0 = ppp_asynctty_open(ppp_ldisc_group1) [L7212] COND TRUE ldv_retval_0 == 0 [L7213] ldv_state_variable_1 = 2 [L7214] ref_cnt = ref_cnt + 1 [L7156] tmp___16 = __VERIFIER_nondet_int() [L7158] case 0: [L7159] COND TRUE ldv_state_variable_1 != 0 [L7160] tmp___17 = __VERIFIER_nondet_int() [L7162] case 0: [L7170] case 1: [L7177] case 2: [L7189] case 3: [L7201] case 4: [L7209] case 5: [L7220] case 6: [L7227] case 7: [L7228] COND TRUE ldv_state_variable_1 == 2 [L7229-L7230] CALL ppp_asynctty_receive(ppp_ldisc_group1, (unsigned char const *)ldvarg5, ldvarg4, ldvarg3) [L6076] struct asyncppp *ap ; [L6077] struct asyncppp *tmp ; [L6078] unsigned long flags ; [L6079] raw_spinlock_t *tmp___0 ; [L6080] int tmp___1 ; [L6082] CALL, EXPR ap_get(tty) [L5800] struct asyncppp *ap ; [L5802] FCALL _raw_read_lock(& disc_data_lock) [L5803] EXPR tty->disc_data [L5803] ap = (struct asyncppp *)tty->disc_data [L5804] COND TRUE (unsigned long )ap != (unsigned long )((struct asyncppp *)0) [L5805] FCALL atomic_inc(& ap->refcnt) [L5808] FCALL _raw_read_unlock(& disc_data_lock) [L5809] return (ap); [L6082] RET, EXPR ap_get(tty) [L6082] tmp = ap_get(tty) [L6083] ap = tmp [L6084] COND FALSE !((unsigned long )ap == (unsigned long )((struct asyncppp *)0)) [L6088] CALL, EXPR spinlock_check(& ap->recv_lock) [L5412] return (& lock->ldv_6338.rlock); [L6088] RET, EXPR spinlock_check(& ap->recv_lock) [L6088] tmp___0 = spinlock_check(& ap->recv_lock) [L6089] CALL, EXPR _raw_spin_lock_irqsave(tmp___0) [L7663] return __VERIFIER_nondet_ulong(); [L6089] RET, EXPR _raw_spin_lock_irqsave(tmp___0) [L6089] flags = _raw_spin_lock_irqsave(tmp___0) [L6090] CALL ppp_async_input(ap, buf, cflags, count) [L6809] struct sk_buff *skb ; [L6810] int c ; [L6811] int i ; [L6812] int j ; [L6813] int n ; [L6814] int s ; [L6815] int f ; [L6816] unsigned char *sp ; [L6817] size_t __len ; [L6818] void *__ret ; [L6819] int tmp ; [L6821] EXPR ap->rbits [L6821] COND FALSE !((~ ap->rbits & 251658240U) != 0U) [L6938] COND TRUE count > 0 [L6846] EXPR ap->state [L6846] (ap->state & 2U) != 0U && (unsigned int )((unsigned char )*buf) == 125U [L6846] EXPR \read(*buf) [L6846] (ap->state & 2U) != 0U && (unsigned int )((unsigned char )*buf) == 125U [L6846] COND TRUE (ap->state & 2U) != 0U && (unsigned int )((unsigned char )*buf) == 125U [L6847] n = 1 [L6851] f = 0 [L6852] (unsigned long )flags != (unsigned long )((char *)0) && (ap->state & 1U) == 0U [L6852] COND FALSE !((unsigned long )flags != (unsigned long )((char *)0) && (ap->state & 1U) == 0U) [L6870] COND FALSE !(f != 0) [L6873] n > 0 && (ap->state & 1U) == 0U [L6873] EXPR ap->state [L6873] n > 0 && (ap->state & 1U) == 0U [L6873] COND TRUE n > 0 && (ap->state & 1U) == 0U [L6874] EXPR ap->rpkt [L6874] skb = ap->rpkt [L6875] COND TRUE (unsigned long )skb == (unsigned long )((struct sk_buff *)0) [L6876] EXPR ap->mru [L6876] CALL, EXPR ldv_dev_alloc_skb_18((unsigned int )(ap->mru + 6)) [L7407] struct sk_buff *tmp ; [L7409] CALL, EXPR ldv_skb_alloc() [L7552] void *skb ; [L7553] void *tmp___7 ; [L7555] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) [L5631] void *p ; [L5632] void *tmp ; [L5633] int tmp___0 ; [L5635] tmp___0 = __VERIFIER_nondet_int() [L5636] COND FALSE !(tmp___0 != 0) [L5639] EXPR, FCALL calloc(1UL, size) [L5639] tmp = calloc(1UL, size) [L5640] p = tmp [L5641] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5610] COND FALSE !(!cond) [L5641] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5642] return (p); [L7555] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) [L7555] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L7556] skb = (struct sk_buff___0 *)tmp___7 [L7557] COND FALSE !(! skb) [L7560] CALL ldv_set_add(LDV_SKBS, skb) [L7428] int i ; [L7430] i = 0 [L7431] COND TRUE 1 [L7432] COND FALSE !(i < last_index) [L7442] COND TRUE last_index < 15 [L7443] set_impl[last_index] = e [L7444] last_index = last_index + 1 [L7560] RET ldv_set_add(LDV_SKBS, skb) [L7561] return (skb); [L7409] RET, EXPR ldv_skb_alloc() [L7409] tmp = ldv_skb_alloc() [L7410] return (tmp); [L6876] RET, EXPR ldv_dev_alloc_skb_18((unsigned int )(ap->mru + 6)) [L6876] skb = ldv_dev_alloc_skb_18((unsigned int )(ap->mru + 6)) [L6877] COND FALSE !((unsigned long )skb == (unsigned long )((struct sk_buff *)0)) [L6881] ap->rpkt = skb [L6884] EXPR skb->len [L6884] COND FALSE !(skb->len == 0U) [L6891] CALL, EXPR skb_tailroom((struct sk_buff const *)skb) [L5583] bool tmp ; [L5585] CALL, EXPR skb_is_nonlinear(skb) [L5569] EXPR skb->data_len [L5569] return ((unsigned int )skb->data_len != 0U); [L5585] RET, EXPR skb_is_nonlinear(skb) [L5585] tmp = skb_is_nonlinear(skb) [L5586] EXPR (int )tmp ? 0 : (int )((unsigned int )skb->end - (unsigned int )skb->tail) [L5586] return ((int )tmp ? 0 : (int )((unsigned int )skb->end - (unsigned int )skb->tail)); [L6891] RET, EXPR skb_tailroom((struct sk_buff const *)skb) [L6891] tmp = skb_tailroom((struct sk_buff const *)skb) [L6892] COND TRUE tmp < n [L6893] EXPR ap->state [L6893] ap->state = ap->state | 1U [L6906] COND TRUE n >= count [L6090] RET ppp_async_input(ap, buf, cflags, count) [L6091] CALL spin_unlock_irqrestore(& ap->recv_lock, flags) [L5446] FCALL _raw_spin_unlock_irqrestore(& lock->ldv_6338.rlock, flags) [L6091] RET spin_unlock_irqrestore(& ap->recv_lock, flags) [L6092] CALL, EXPR skb_queue_empty((struct sk_buff_head const *)(& ap->rqueue)) [L5540] EXPR list->next [L5540] return ((unsigned long )((struct sk_buff const *)list->next) == (unsigned long )((struct sk_buff const *)list)); [L6092] RET, EXPR skb_queue_empty((struct sk_buff_head const *)(& ap->rqueue)) [L6092] tmp___1 = skb_queue_empty((struct sk_buff_head const *)(& ap->rqueue)) [L6093] COND FALSE !(tmp___1 == 0) [L6097] CALL ap_put(ap) [L5814] int tmp ; [L5816] CALL, EXPR atomic_dec_and_test(& ap->refcnt) [L5389] char c ; [L5393] return ((int )((signed char )c) != 0); [L5816] RET, EXPR atomic_dec_and_test(& ap->refcnt) [L5816] tmp = atomic_dec_and_test(& ap->refcnt) [L5817] COND FALSE !(tmp != 0) [L6097] RET ap_put(ap) [L6098] FCALL tty_unthrottle(tty) [L7229-L7230] RET ppp_asynctty_receive(ppp_ldisc_group1, (unsigned char const *)ldvarg5, ldvarg4, ldvarg3) [L7231] ldv_state_variable_1 = 2 [L7156] tmp___16 = __VERIFIER_nondet_int() [L7158] case 0: [L7159] COND TRUE ldv_state_variable_1 != 0 [L7160] tmp___17 = __VERIFIER_nondet_int() [L7162] case 0: [L7170] case 1: [L7177] case 2: [L7189] case 3: [L7201] case 4: [L7202] COND TRUE ldv_state_variable_1 == 2 [L7203] CALL ppp_asynctty_close(ppp_ldisc_group1) [L5887] struct asyncppp *ap ; [L5888] int tmp ; [L5890] FCALL _raw_write_lock_irq(& disc_data_lock) [L5891] EXPR tty->disc_data [L5891] ap = (struct asyncppp *)tty->disc_data [L5892] tty->disc_data = (void *)0 [L5893] FCALL _raw_write_unlock_irq(& disc_data_lock) [L5894] COND TRUE (unsigned long )ap == (unsigned long )((struct asyncppp *)0) [L7203] RET ppp_asynctty_close(ppp_ldisc_group1) [L7204] ldv_state_variable_1 = 1 [L7205] ref_cnt = ref_cnt - 1 [L7156] tmp___16 = __VERIFIER_nondet_int() [L7158] case 0: [L7254] case 1: [L7255] COND TRUE ldv_state_variable_0 != 0 [L7256] tmp___18 = __VERIFIER_nondet_int() [L7258] case 0: [L7259] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L7260] CALL ppp_async_cleanup() [L7043] int tmp ; [L7045] CALL, EXPR tty_unregister_ldisc(3) [L7767] return __VERIFIER_nondet_int(); [L7045] RET, EXPR tty_unregister_ldisc(3) [L7045] tmp = tty_unregister_ldisc(3) [L7046] COND FALSE !(tmp != 0) [L7260] RET ppp_async_cleanup() [L7261] ldv_state_variable_0 = 2 [L7323] CALL ldv_check_final_state() [L7619] int tmp___7 ; [L7621] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L7510] return (last_index == 0); [L7621] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L7621] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L7622] COND FALSE !(\read(tmp___7)) [L7624] CALL ldv_error() [L5666] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 38 procedures, 724 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 197.2s, OverallIterations: 20, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 82.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 30452 SdHoareTripleChecker+Valid, 55.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29928 mSDsluCounter, 139184 SdHoareTripleChecker+Invalid, 51.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111197 mSDsCounter, 3401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7504 IncrementalHoareTripleChecker+Invalid, 10907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3401 mSolverCounterUnsat, 27987 mSDtfsCounter, 7504 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7793 GetRequests, 7639 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109969occurred in iteration=17, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 114696 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 73.4s InterpolantComputationTime, 4170 NumberOfCodeBlocks, 3953 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 8018 ConstructedInterpolants, 10 QuantifiedInterpolants, 14537 SizeOfPredicates, 124 NumberOfNonLiveVariables, 15656 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 39 InterpolantComputations, 30 PerfectInterpolantSequences, 11986/12129 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-17 00:56:38,625 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 Writing output log to file Ultimate.log Result: UNKNOWN