./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 6c24879c 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.2-?-6c24879 [2022-07-12 12:35:07,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:35:07,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:35:07,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:35:07,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:35:07,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:35:07,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:35:07,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:35:07,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:35:07,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:35:07,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:35:07,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:35:07,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:35:07,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:35:07,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:35:07,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:35:07,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:35:07,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:35:07,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:35:07,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:35:07,407 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:35:07,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:35:07,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:35:07,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:35:07,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:35:07,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:35:07,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:35:07,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:35:07,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:35:07,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:35:07,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:35:07,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:35:07,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:35:07,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:35:07,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:35:07,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:35:07,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:35:07,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:35:07,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:35:07,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:35:07,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:35:07,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:35:07,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:35:07,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:35:07,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:35:07,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:35:07,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:35:07,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:35:07,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:35:07,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:35:07,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:35:07,455 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:35:07,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:35:07,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:35:07,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:35:07,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:35:07,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:35:07,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:35:07,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:35:07,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:35:07,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:35:07,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:35:07,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:35:07,461 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 [2022-07-12 12:35:07,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:35:07,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:35:07,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:35:07,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:35:07,687 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:35:07,688 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 [2022-07-12 12:35:07,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad60451a/42b7770381b4448bae6c3a4849e8a082/FLAG2c1173338 [2022-07-12 12:35:08,318 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:35:08,327 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 [2022-07-12 12:35:08,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad60451a/42b7770381b4448bae6c3a4849e8a082/FLAG2c1173338 [2022-07-12 12:35:08,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad60451a/42b7770381b4448bae6c3a4849e8a082 [2022-07-12 12:35:08,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:35:08,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:35:08,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:35:08,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:35:08,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:35:08,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:35:08" (1/1) ... [2022-07-12 12:35:08,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a52af8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:08, skipping insertion in model container [2022-07-12 12:35:08,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:35:08" (1/1) ... [2022-07-12 12:35:08,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:35:08,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:35:09,283 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] [2022-07-12 12:35:09,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:35:09,545 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:35:09,671 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] [2022-07-12 12:35:09,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:35:09,836 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:35:09,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09 WrapperNode [2022-07-12 12:35:09,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:35:09,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:35:09,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:35:09,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:35:09,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:09,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:09,996 INFO L137 Inliner]: procedures = 180, calls = 578, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2426 [2022-07-12 12:35:09,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:35:09,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:35:09,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:35:09,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:35:10,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:35:10,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:35:10,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:35:10,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:35:10,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (1/1) ... [2022-07-12 12:35:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:35:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:35:10,160 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) [2022-07-12 12:35:10,199 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 [2022-07-12 12:35:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 12:35:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2022-07-12 12:35:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-12 12:35:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:35:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:35:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:35:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:35:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2022-07-12 12:35:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2022-07-12 12:35:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2022-07-12 12:35:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2022-07-12 12:35:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2022-07-12 12:35:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2022-07-12 12:35:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:35:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:35:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:35:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2022-07-12 12:35:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2022-07-12 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 12:35:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-07-12 12:35:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-07-12 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-12 12:35:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-12 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:35:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:35:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:35:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:35:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:35:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:35:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 12:35:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 12:35:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:35:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2022-07-12 12:35:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2022-07-12 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2022-07-12 12:35:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2022-07-12 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 12:35:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 12:35:10,216 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 12:35:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:35:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:35:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:35:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 12:35:10,217 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 12:35:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2022-07-12 12:35:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2022-07-12 12:35:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-12 12:35:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-12 12:35:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:35:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:35:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:35:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-07-12 12:35:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-07-12 12:35:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:35:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:35:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 12:35:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 12:35:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 12:35:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 12:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2022-07-12 12:35:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2022-07-12 12:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-12 12:35:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-12 12:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:35:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:35:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 12:35:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 12:35:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:35:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:35:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2022-07-12 12:35:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2022-07-12 12:35:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-12 12:35:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-12 12:35:10,624 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:35:10,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:35:10,997 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:35:14,085 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:35:14,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:35:14,110 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:35:14,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:35:14 BoogieIcfgContainer [2022-07-12 12:35:14,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:35:14,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:35:14,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:35:14,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:35:14,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:35:08" (1/3) ... [2022-07-12 12:35:14,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6078d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:35:14, skipping insertion in model container [2022-07-12 12:35:14,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:35:09" (2/3) ... [2022-07-12 12:35:14,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6078d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:35:14, skipping insertion in model container [2022-07-12 12:35:14,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:35:14" (3/3) ... [2022-07-12 12:35:14,119 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 [2022-07-12 12:35:14,128 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:35:14,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:35:14,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:35:14,196 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ac39690, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d52a2d5 [2022-07-12 12:35:14,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:35:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 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) [2022-07-12 12:35:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 12:35:14,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:14,215 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:14,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1070293405, now seen corresponding path program 1 times [2022-07-12 12:35:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:14,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873290140] [2022-07-12 12:35:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 12:35:14,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:14,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873290140] [2022-07-12 12:35:14,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873290140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:14,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:14,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:35:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137257218] [2022-07-12 12:35:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:14,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:35:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:35:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:35:14,615 INFO L87 Difference]: Start difference. First operand has 745 states, 591 states have (on average 1.4568527918781726) internal successors, (861), 605 states have internal predecessors, (861), 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) [2022-07-12 12:35:17,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:20,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:20,234 INFO L93 Difference]: Finished difference Result 2318 states and 3473 transitions. [2022-07-12 12:35:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:35:20,236 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 [2022-07-12 12:35:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:20,255 INFO L225 Difference]: With dead ends: 2318 [2022-07-12 12:35:20,263 INFO L226 Difference]: Without dead ends: 1560 [2022-07-12 12:35:20,275 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:35:20,284 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 1446 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 305 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:20,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 2223 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 886 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 12:35:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-07-12 12:35:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1388. [2022-07-12 12:35:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1108 states have (on average 1.4296028880866427) internal successors, (1584), 1124 states have internal predecessors, (1584), 209 states have call successors, (209), 71 states have call predecessors, (209), 70 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2022-07-12 12:35:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2001 transitions. [2022-07-12 12:35:20,417 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2001 transitions. Word has length 78 [2022-07-12 12:35:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:20,417 INFO L495 AbstractCegarLoop]: Abstraction has 1388 states and 2001 transitions. [2022-07-12 12:35:20,418 INFO L496 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) [2022-07-12 12:35:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2001 transitions. [2022-07-12 12:35:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 12:35:20,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:20,421 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:20,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:35:20,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash 192122725, now seen corresponding path program 1 times [2022-07-12 12:35:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:20,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510316487] [2022-07-12 12:35:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 12:35:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510316487] [2022-07-12 12:35:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510316487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:20,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:20,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:35:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645412388] [2022-07-12 12:35:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:35:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:35:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:35:20,605 INFO L87 Difference]: Start difference. First operand 1388 states and 2001 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) [2022-07-12 12:35:24,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:26,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:26,741 INFO L93 Difference]: Finished difference Result 4449 states and 6499 transitions. [2022-07-12 12:35:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:35:26,742 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 [2022-07-12 12:35:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:26,755 INFO L225 Difference]: With dead ends: 4449 [2022-07-12 12:35:26,755 INFO L226 Difference]: Without dead ends: 3079 [2022-07-12 12:35:26,760 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:35:26,761 INFO L413 NwaCegarLoop]: 1082 mSDtfsCounter, 1479 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 319 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:26,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 3538 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1854 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 12:35:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2022-07-12 12:35:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 2815. [2022-07-12 12:35:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2249 states have (on average 1.4313028012449978) internal successors, (3219), 2287 states have internal predecessors, (3219), 417 states have call successors, (417), 141 states have call predecessors, (417), 148 states have return successors, (458), 418 states have call predecessors, (458), 416 states have call successors, (458) [2022-07-12 12:35:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4094 transitions. [2022-07-12 12:35:26,840 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4094 transitions. Word has length 82 [2022-07-12 12:35:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:26,841 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 4094 transitions. [2022-07-12 12:35:26,841 INFO L496 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) [2022-07-12 12:35:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4094 transitions. [2022-07-12 12:35:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 12:35:26,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:26,856 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:26,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:35:26,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash 793541372, now seen corresponding path program 1 times [2022-07-12 12:35:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594728186] [2022-07-12 12:35:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 12:35:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:35:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:35:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:35:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-12 12:35:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594728186] [2022-07-12 12:35:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594728186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:27,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:35:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590341601] [2022-07-12 12:35:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:35:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:35:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:35:27,093 INFO L87 Difference]: Start difference. First operand 2815 states and 4094 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) [2022-07-12 12:35:30,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:30,984 INFO L93 Difference]: Finished difference Result 7425 states and 10845 transitions. [2022-07-12 12:35:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:35:30,985 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 [2022-07-12 12:35:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:31,001 INFO L225 Difference]: With dead ends: 7425 [2022-07-12 12:35:31,001 INFO L226 Difference]: Without dead ends: 4634 [2022-07-12 12:35:31,008 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:35:31,011 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 1923 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 762 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:31,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 2386 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 1345 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 12:35:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2022-07-12 12:35:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4145. [2022-07-12 12:35:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 3305 states have (on average 1.4338880484114978) internal successors, (4739), 3359 states have internal predecessors, (4739), 605 states have call successors, (605), 213 states have call predecessors, (605), 234 states have return successors, (680), 610 states have call predecessors, (680), 604 states have call successors, (680) [2022-07-12 12:35:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6024 transitions. [2022-07-12 12:35:31,166 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6024 transitions. Word has length 140 [2022-07-12 12:35:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:31,171 INFO L495 AbstractCegarLoop]: Abstraction has 4145 states and 6024 transitions. [2022-07-12 12:35:31,171 INFO L496 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) [2022-07-12 12:35:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6024 transitions. [2022-07-12 12:35:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 12:35:31,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:31,178 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:31,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:35:31,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash -850191257, now seen corresponding path program 1 times [2022-07-12 12:35:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:31,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277633794] [2022-07-12 12:35:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:35:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:35:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 12:35:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:35:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 12:35:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:35:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 12:35:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:35:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:35:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-12 12:35:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277633794] [2022-07-12 12:35:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277633794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:31,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:31,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:35:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903667053] [2022-07-12 12:35:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:35:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:35:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:35:31,385 INFO L87 Difference]: Start difference. First operand 4145 states and 6024 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:35:35,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:37,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:39,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:41,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:41,447 INFO L93 Difference]: Finished difference Result 10898 states and 15785 transitions. [2022-07-12 12:35:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:35:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 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 [2022-07-12 12:35:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:41,483 INFO L225 Difference]: With dead ends: 10898 [2022-07-12 12:35:41,483 INFO L226 Difference]: Without dead ends: 6777 [2022-07-12 12:35:41,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:35:41,496 INFO L413 NwaCegarLoop]: 1492 mSDtfsCounter, 1567 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 536 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:41,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 3421 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1432 Invalid, 4 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 12:35:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6777 states. [2022-07-12 12:35:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6777 to 6142. [2022-07-12 12:35:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 4931 states have (on average 1.4232407219630907) internal successors, (7018), 5015 states have internal predecessors, (7018), 840 states have call successors, (840), 335 states have call predecessors, (840), 370 states have return successors, (961), 851 states have call predecessors, (961), 839 states have call successors, (961) [2022-07-12 12:35:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 8819 transitions. [2022-07-12 12:35:41,719 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 8819 transitions. Word has length 169 [2022-07-12 12:35:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:41,721 INFO L495 AbstractCegarLoop]: Abstraction has 6142 states and 8819 transitions. [2022-07-12 12:35:41,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 12:35:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 8819 transitions. [2022-07-12 12:35:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 12:35:41,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:41,732 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:41,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:35:41,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1242981819, now seen corresponding path program 1 times [2022-07-12 12:35:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:41,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300396428] [2022-07-12 12:35:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:35:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:35:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:35:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:35:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:35:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:35:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-07-12 12:35:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:41,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300396428] [2022-07-12 12:35:41,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300396428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:41,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:41,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:35:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138379119] [2022-07-12 12:35:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:41,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:35:41,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:35:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:35:41,956 INFO L87 Difference]: Start difference. First operand 6142 states and 8819 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) [2022-07-12 12:35:46,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:48,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:48,556 INFO L93 Difference]: Finished difference Result 15902 states and 22823 transitions. [2022-07-12 12:35:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:35:48,558 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 [2022-07-12 12:35:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:48,626 INFO L225 Difference]: With dead ends: 15902 [2022-07-12 12:35:48,626 INFO L226 Difference]: Without dead ends: 9795 [2022-07-12 12:35:48,637 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:35:48,639 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 2814 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 1112 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1112 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:48,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 2415 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1112 Valid, 1442 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 12:35:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2022-07-12 12:35:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8838. [2022-07-12 12:35:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 7083 states have (on average 1.4126782436820555) internal successors, (10006), 7203 states have internal predecessors, (10006), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-12 12:35:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 12522 transitions. [2022-07-12 12:35:48,919 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 12522 transitions. Word has length 163 [2022-07-12 12:35:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:48,920 INFO L495 AbstractCegarLoop]: Abstraction has 8838 states and 12522 transitions. [2022-07-12 12:35:48,921 INFO L496 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) [2022-07-12 12:35:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 12522 transitions. [2022-07-12 12:35:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 12:35:48,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:48,930 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:48,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:35:48,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2102218924, now seen corresponding path program 1 times [2022-07-12 12:35:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007441803] [2022-07-12 12:35:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:35:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:35:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:35:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:35:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:35:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:35:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 12:35:49,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:49,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007441803] [2022-07-12 12:35:49,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007441803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:35:49,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:35:49,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:35:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877257904] [2022-07-12 12:35:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:35:49,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:35:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:35:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:35:49,163 INFO L87 Difference]: Start difference. First operand 8838 states and 12522 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) [2022-07-12 12:35:52,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:54,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:35:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:35:55,081 INFO L93 Difference]: Finished difference Result 14382 states and 20599 transitions. [2022-07-12 12:35:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:35:55,082 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 [2022-07-12 12:35:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:35:55,116 INFO L225 Difference]: With dead ends: 14382 [2022-07-12 12:35:55,117 INFO L226 Difference]: Without dead ends: 9802 [2022-07-12 12:35:55,130 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:35:55,131 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 659 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 299 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:35:55,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 3210 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1650 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 12:35:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-07-12 12:35:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8858. [2022-07-12 12:35:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7103 states have (on average 1.4115162607349008) internal successors, (10026), 7223 states have internal predecessors, (10026), 1172 states have call successors, (1172), 525 states have call predecessors, (1172), 582 states have return successors, (1344), 1189 states have call predecessors, (1344), 1171 states have call successors, (1344) [2022-07-12 12:35:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 12542 transitions. [2022-07-12 12:35:55,425 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 12542 transitions. Word has length 168 [2022-07-12 12:35:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:35:55,425 INFO L495 AbstractCegarLoop]: Abstraction has 8858 states and 12542 transitions. [2022-07-12 12:35:55,426 INFO L496 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) [2022-07-12 12:35:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 12542 transitions. [2022-07-12 12:35:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 12:35:55,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:35:55,438 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:35:55,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:35:55,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:35:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:35:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1844834605, now seen corresponding path program 1 times [2022-07-12 12:35:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:35:55,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955192566] [2022-07-12 12:35:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:35:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:35:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:35:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:35:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:35:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:35:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:35:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:35:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:35:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:35:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:35:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:35:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 12:35:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 12:35:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:35:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:35:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:35:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 12:35:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-12 12:35:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:35:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955192566] [2022-07-12 12:35:55,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955192566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:35:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492051578] [2022-07-12 12:35:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:35:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:35:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:35:55,768 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) [2022-07-12 12:35:55,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:35:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:35:56,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 12:35:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:35:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-12 12:35:56,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:35:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 12:35:57,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492051578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:35:57,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:35:57,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 17 [2022-07-12 12:35:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108922420] [2022-07-12 12:35:57,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:35:57,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 12:35:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:35:57,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 12:35:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:35:57,052 INFO L87 Difference]: Start difference. First operand 8858 states and 12542 transitions. Second operand has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-12 12:36:03,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:05,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:09,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:11,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:13,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:13,494 INFO L93 Difference]: Finished difference Result 24105 states and 34353 transitions. [2022-07-12 12:36:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 12:36:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) Word has length 170 [2022-07-12 12:36:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:13,546 INFO L225 Difference]: With dead ends: 24105 [2022-07-12 12:36:13,546 INFO L226 Difference]: Without dead ends: 15282 [2022-07-12 12:36:13,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 378 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1399, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 12:36:13,565 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 4828 mSDsluCounter, 5483 mSDsCounter, 0 mSdLazyCounter, 6125 mSolverCounterSat, 1879 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4962 SdHoareTripleChecker+Valid, 6516 SdHoareTripleChecker+Invalid, 8009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1879 IncrementalHoareTripleChecker+Valid, 6125 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:13,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4962 Valid, 6516 Invalid, 8009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1879 Valid, 6125 Invalid, 5 Unknown, 0 Unchecked, 15.5s Time] [2022-07-12 12:36:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15282 states. [2022-07-12 12:36:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15282 to 13435. [2022-07-12 12:36:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13435 states, 10715 states have (on average 1.4011199253383109) internal successors, (15013), 10881 states have internal predecessors, (15013), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-12 12:36:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13435 states to 13435 states and 18852 transitions. [2022-07-12 12:36:13,990 INFO L78 Accepts]: Start accepts. Automaton has 13435 states and 18852 transitions. Word has length 170 [2022-07-12 12:36:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:13,990 INFO L495 AbstractCegarLoop]: Abstraction has 13435 states and 18852 transitions. [2022-07-12 12:36:13,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.3125) internal successors, (181), 13 states have internal predecessors, (181), 8 states have call successors, (48), 9 states have call predecessors, (48), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2022-07-12 12:36:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13435 states and 18852 transitions. [2022-07-12 12:36:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 12:36:14,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:14,003 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:14,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 12:36:14,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:14,216 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1828209139, now seen corresponding path program 1 times [2022-07-12 12:36:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945687787] [2022-07-12 12:36:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 12:36:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:36:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 12:36:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:36:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-12 12:36:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:14,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945687787] [2022-07-12 12:36:14,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945687787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:14,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:36:14,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:36:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934411218] [2022-07-12 12:36:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:14,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:36:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:36:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:36:14,438 INFO L87 Difference]: Start difference. First operand 13435 states and 18852 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) [2022-07-12 12:36:18,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:19,009 INFO L93 Difference]: Finished difference Result 33436 states and 46809 transitions. [2022-07-12 12:36:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:36:19,009 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 [2022-07-12 12:36:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:19,110 INFO L225 Difference]: With dead ends: 33436 [2022-07-12 12:36:19,111 INFO L226 Difference]: Without dead ends: 20036 [2022-07-12 12:36:19,137 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:36:19,138 INFO L413 NwaCegarLoop]: 1610 mSDtfsCounter, 1412 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 448 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:19,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 3703 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1882 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 12:36:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2022-07-12 12:36:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 13459. [2022-07-12 12:36:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13459 states, 10739 states have (on average 1.400223484495763) internal successors, (15037), 10905 states have internal predecessors, (15037), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 903 states have return successors, (2023), 1835 states have call predecessors, (2023), 1815 states have call successors, (2023) [2022-07-12 12:36:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 18876 transitions. [2022-07-12 12:36:19,678 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 18876 transitions. Word has length 195 [2022-07-12 12:36:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:19,679 INFO L495 AbstractCegarLoop]: Abstraction has 13459 states and 18876 transitions. [2022-07-12 12:36:19,679 INFO L496 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) [2022-07-12 12:36:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 18876 transitions. [2022-07-12 12:36:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 12:36:19,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:19,694 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:36:19,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1124632277, now seen corresponding path program 1 times [2022-07-12 12:36:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:19,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713350108] [2022-07-12 12:36:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:36:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:36:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:36:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 12:36:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 12:36:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:20,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713350108] [2022-07-12 12:36:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713350108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:36:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:36:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686093226] [2022-07-12 12:36:20,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:36:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:36:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:36:20,037 INFO L87 Difference]: Start difference. First operand 13459 states and 18876 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) [2022-07-12 12:36:24,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:26,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:28,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:28,908 INFO L93 Difference]: Finished difference Result 28371 states and 39874 transitions. [2022-07-12 12:36:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:36:28,909 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 [2022-07-12 12:36:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:28,948 INFO L225 Difference]: With dead ends: 28371 [2022-07-12 12:36:28,948 INFO L226 Difference]: Without dead ends: 14947 [2022-07-12 12:36:28,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:36:28,970 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 394 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:28,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 3880 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2326 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-07-12 12:36:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-07-12 12:36:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13507. [2022-07-12 12:36:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13507 states, 10775 states have (on average 1.3988863109048724) internal successors, (15073), 10941 states have internal predecessors, (15073), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-12 12:36:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13507 states to 13507 states and 18927 transitions. [2022-07-12 12:36:29,409 INFO L78 Accepts]: Start accepts. Automaton has 13507 states and 18927 transitions. Word has length 206 [2022-07-12 12:36:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:29,410 INFO L495 AbstractCegarLoop]: Abstraction has 13507 states and 18927 transitions. [2022-07-12 12:36:29,410 INFO L496 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) [2022-07-12 12:36:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13507 states and 18927 transitions. [2022-07-12 12:36:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 12:36:29,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:29,484 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:36:29,485 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -928227653, now seen corresponding path program 1 times [2022-07-12 12:36:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:29,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614565355] [2022-07-12 12:36:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:36:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:36:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 12:36:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 12:36:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-12 12:36:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614565355] [2022-07-12 12:36:29,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614565355] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:36:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325096433] [2022-07-12 12:36:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:29,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:36:29,681 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) [2022-07-12 12:36:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:36:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:30,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:36:30,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:36:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-12 12:36:30,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:36:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325096433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:30,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:36:30,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-12 12:36:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885923764] [2022-07-12 12:36:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:36:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:36:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:36:30,115 INFO L87 Difference]: Start difference. First operand 13507 states and 18927 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) [2022-07-12 12:36:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:30,890 INFO L93 Difference]: Finished difference Result 33048 states and 46290 transitions. [2022-07-12 12:36:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:36:30,891 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 [2022-07-12 12:36:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:30,941 INFO L225 Difference]: With dead ends: 33048 [2022-07-12 12:36:30,941 INFO L226 Difference]: Without dead ends: 19576 [2022-07-12 12:36:30,961 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:36:30,962 INFO L413 NwaCegarLoop]: 1898 mSDtfsCounter, 1323 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 6119 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:30,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 6119 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:36:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2022-07-12 12:36:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 13519. [2022-07-12 12:36:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13519 states, 10787 states have (on average 1.3984425697598961) internal successors, (15085), 10941 states have internal predecessors, (15085), 1816 states have call successors, (1816), 850 states have call predecessors, (1816), 915 states have return successors, (2038), 1847 states have call predecessors, (2038), 1815 states have call successors, (2038) [2022-07-12 12:36:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13519 states to 13519 states and 18939 transitions. [2022-07-12 12:36:31,487 INFO L78 Accepts]: Start accepts. Automaton has 13519 states and 18939 transitions. Word has length 213 [2022-07-12 12:36:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:31,488 INFO L495 AbstractCegarLoop]: Abstraction has 13519 states and 18939 transitions. [2022-07-12 12:36:31,488 INFO L496 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) [2022-07-12 12:36:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 13519 states and 18939 transitions. [2022-07-12 12:36:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-12 12:36:31,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:31,507 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:31,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:36:31,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 12:36:31,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -486438682, now seen corresponding path program 1 times [2022-07-12 12:36:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:31,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671305355] [2022-07-12 12:36:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:36:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:36:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:36:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:36:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:36:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 12:36:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:36:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:36:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:36:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:36:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-12 12:36:32,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:32,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671305355] [2022-07-12 12:36:32,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671305355] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:36:32,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737599436] [2022-07-12 12:36:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:32,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:36:32,125 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) [2022-07-12 12:36:32,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:36:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:32,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:36:32,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:36:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-12 12:36:32,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:36:32,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737599436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:32,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:36:32,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-07-12 12:36:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293081493] [2022-07-12 12:36:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:32,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:36:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:36:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:36:32,969 INFO L87 Difference]: Start difference. First operand 13519 states and 18939 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) [2022-07-12 12:36:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:33,864 INFO L93 Difference]: Finished difference Result 18303 states and 25413 transitions. [2022-07-12 12:36:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:36:33,865 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 [2022-07-12 12:36:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:33,928 INFO L225 Difference]: With dead ends: 18303 [2022-07-12 12:36:33,929 INFO L226 Difference]: Without dead ends: 18294 [2022-07-12 12:36:33,941 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:36:33,941 INFO L413 NwaCegarLoop]: 1732 mSDtfsCounter, 1622 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:33,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 2318 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:36:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18294 states. [2022-07-12 12:36:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18294 to 16793. [2022-07-12 12:36:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 13347 states have (on average 1.386603731175545) internal successors, (18507), 13535 states have internal predecessors, (18507), 2278 states have call successors, (2278), 1080 states have call predecessors, (2278), 1167 states have return successors, (2584), 2321 states have call predecessors, (2584), 2277 states have call successors, (2584) [2022-07-12 12:36:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 23369 transitions. [2022-07-12 12:36:34,681 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 23369 transitions. Word has length 251 [2022-07-12 12:36:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:34,687 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 23369 transitions. [2022-07-12 12:36:34,688 INFO L496 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) [2022-07-12 12:36:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 23369 transitions. [2022-07-12 12:36:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-12 12:36:34,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:34,701 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:34,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 12:36:34,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:34,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1296230958, now seen corresponding path program 1 times [2022-07-12 12:36:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:34,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745919911] [2022-07-12 12:36:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:36:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:36:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:36:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:36:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:36:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 12:36:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:36:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:36:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:36:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:36:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-12 12:36:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:35,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745919911] [2022-07-12 12:36:35,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745919911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:35,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:36:35,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:36:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863775389] [2022-07-12 12:36:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:35,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:36:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:35,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:36:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:36:35,266 INFO L87 Difference]: Start difference. First operand 16793 states and 23369 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) [2022-07-12 12:36:38,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:40,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:40,939 INFO L93 Difference]: Finished difference Result 25950 states and 36184 transitions. [2022-07-12 12:36:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:36:40,940 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 [2022-07-12 12:36:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:40,965 INFO L225 Difference]: With dead ends: 25950 [2022-07-12 12:36:40,966 INFO L226 Difference]: Without dead ends: 8033 [2022-07-12 12:36:40,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:36:40,997 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1472 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 457 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:40,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1940 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 568 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 12:36:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2022-07-12 12:36:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 7346. [2022-07-12 12:36:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7346 states, 5820 states have (on average 1.3752577319587629) internal successors, (8004), 5903 states have internal predecessors, (8004), 999 states have call successors, (999), 486 states have call predecessors, (999), 526 states have return successors, (1142), 1022 states have call predecessors, (1142), 998 states have call successors, (1142) [2022-07-12 12:36:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10145 transitions. [2022-07-12 12:36:41,412 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10145 transitions. Word has length 255 [2022-07-12 12:36:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:41,413 INFO L495 AbstractCegarLoop]: Abstraction has 7346 states and 10145 transitions. [2022-07-12 12:36:41,413 INFO L496 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) [2022-07-12 12:36:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10145 transitions. [2022-07-12 12:36:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-12 12:36:41,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:41,421 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:36:41,421 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1689020113, now seen corresponding path program 1 times [2022-07-12 12:36:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:41,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103595660] [2022-07-12 12:36:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 12:36:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:36:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:36:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 12:36:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:36:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 12:36:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:36:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 12:36:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 12:36:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 12:36:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-12 12:36:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-12 12:36:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:41,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103595660] [2022-07-12 12:36:41,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103595660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:41,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:36:41,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:36:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522319567] [2022-07-12 12:36:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:41,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:36:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:36:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:36:41,816 INFO L87 Difference]: Start difference. First operand 7346 states and 10145 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) [2022-07-12 12:36:47,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:49,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:51,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:53,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:36:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:53,930 INFO L93 Difference]: Finished difference Result 17482 states and 24607 transitions. [2022-07-12 12:36:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:36:53,930 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 [2022-07-12 12:36:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:53,957 INFO L225 Difference]: With dead ends: 17482 [2022-07-12 12:36:53,957 INFO L226 Difference]: Without dead ends: 10217 [2022-07-12 12:36:53,973 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:36:53,973 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1812 mSDsluCounter, 6300 mSDsCounter, 0 mSdLazyCounter, 4592 mSolverCounterSat, 372 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 7503 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 4592 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:36:53,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 7503 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 4592 Invalid, 4 Unknown, 0 Unchecked, 11.5s Time] [2022-07-12 12:36:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2022-07-12 12:36:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 7416. [2022-07-12 12:36:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7416 states, 5880 states have (on average 1.3714285714285714) internal successors, (8064), 5963 states have internal predecessors, (8064), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-12 12:36:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 10215 transitions. [2022-07-12 12:36:54,347 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 10215 transitions. Word has length 268 [2022-07-12 12:36:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:54,347 INFO L495 AbstractCegarLoop]: Abstraction has 7416 states and 10215 transitions. [2022-07-12 12:36:54,348 INFO L496 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) [2022-07-12 12:36:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 10215 transitions. [2022-07-12 12:36:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-12 12:36:54,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:54,356 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:54,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:36:54,356 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1797631130, now seen corresponding path program 1 times [2022-07-12 12:36:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:54,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632154810] [2022-07-12 12:36:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:36:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:36:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:36:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:36:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:36:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:36:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:36:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 12:36:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 12:36:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 12:36:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 12:36:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 12:36:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:54,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632154810] [2022-07-12 12:36:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632154810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:36:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022395317] [2022-07-12 12:36:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:36:54,731 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) [2022-07-12 12:36:54,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:36:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:55,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2286 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 12:36:55,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:36:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-12 12:36:55,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:36:55,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022395317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:55,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:36:55,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 12:36:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540032850] [2022-07-12 12:36:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:55,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:36:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:55,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:36:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:36:55,375 INFO L87 Difference]: Start difference. First operand 7416 states and 10215 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) [2022-07-12 12:36:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:36:55,663 INFO L93 Difference]: Finished difference Result 14801 states and 20390 transitions. [2022-07-12 12:36:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:36:55,663 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 [2022-07-12 12:36:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:36:55,690 INFO L225 Difference]: With dead ends: 14801 [2022-07-12 12:36:55,691 INFO L226 Difference]: Without dead ends: 7415 [2022-07-12 12:36:55,709 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:36:55,712 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 6 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4099 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 [2022-07-12 12:36:55,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4099 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:36:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2022-07-12 12:36:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 7415. [2022-07-12 12:36:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 5879 states have (on average 1.3711515563871406) internal successors, (8061), 5962 states have internal predecessors, (8061), 999 states have call successors, (999), 486 states have call predecessors, (999), 536 states have return successors, (1152), 1032 states have call predecessors, (1152), 998 states have call successors, (1152) [2022-07-12 12:36:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 10212 transitions. [2022-07-12 12:36:56,008 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 10212 transitions. Word has length 274 [2022-07-12 12:36:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:36:56,008 INFO L495 AbstractCegarLoop]: Abstraction has 7415 states and 10212 transitions. [2022-07-12 12:36:56,008 INFO L496 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) [2022-07-12 12:36:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 10212 transitions. [2022-07-12 12:36:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-12 12:36:56,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:36:56,016 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:36:56,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:36:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:56,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:36:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:36:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 925220568, now seen corresponding path program 1 times [2022-07-12 12:36:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:36:56,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582605784] [2022-07-12 12:36:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:36:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:36:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:36:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:36:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:36:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:36:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:36:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:36:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:36:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:36:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:36:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:36:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:36:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:36:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:36:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:36:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:36:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:36:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:36:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:36:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:36:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 12:36:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 12:36:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:36:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 12:36:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:36:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 12:36:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 12:36:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:36:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582605784] [2022-07-12 12:36:56,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582605784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:36:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267751716] [2022-07-12 12:36:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:36:56,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:36:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:36:56,707 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) [2022-07-12 12:36:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:36:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:36:57,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 12:36:57,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:36:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-07-12 12:36:57,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:36:57,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267751716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:36:57,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:36:57,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 12:36:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245166907] [2022-07-12 12:36:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:36:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:36:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:36:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:36:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:36:57,496 INFO L87 Difference]: Start difference. First operand 7415 states and 10212 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2022-07-12 12:36:59,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:01,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:02,874 INFO L93 Difference]: Finished difference Result 16478 states and 23122 transitions. [2022-07-12 12:37:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:37:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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 [2022-07-12 12:37:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:02,904 INFO L225 Difference]: With dead ends: 16478 [2022-07-12 12:37:02,904 INFO L226 Difference]: Without dead ends: 9143 [2022-07-12 12:37:02,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:37:02,923 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 297 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:02,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 4650 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 12:37:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9143 states. [2022-07-12 12:37:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9143 to 7745. [2022-07-12 12:37:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 6191 states have (on average 1.3824907123243417) internal successors, (8559), 6274 states have internal predecessors, (8559), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 536 states have return successors, (1170), 1050 states have call predecessors, (1170), 1016 states have call successors, (1170) [2022-07-12 12:37:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 10746 transitions. [2022-07-12 12:37:03,365 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 10746 transitions. Word has length 274 [2022-07-12 12:37:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:03,366 INFO L495 AbstractCegarLoop]: Abstraction has 7745 states and 10746 transitions. [2022-07-12 12:37:03,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2022-07-12 12:37:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 10746 transitions. [2022-07-12 12:37:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-12 12:37:03,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:03,375 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:03,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:37:03,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 12:37:03,592 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash -132617510, now seen corresponding path program 1 times [2022-07-12 12:37:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:03,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782406664] [2022-07-12 12:37:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:37:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:37:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:37:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:37:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:37:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:37:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:37:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:37:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:37:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:37:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:37:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:37:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:37:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:37:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:37:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 12:37:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 12:37:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:37:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 12:37:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 12:37:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2022-07-12 12:37:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:04,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782406664] [2022-07-12 12:37:04,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782406664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:04,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:04,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:37:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214091270] [2022-07-12 12:37:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:04,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:37:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:37:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:37:04,092 INFO L87 Difference]: Start difference. First operand 7745 states and 10746 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) [2022-07-12 12:37:07,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:10,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:13,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:15,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:15,242 INFO L93 Difference]: Finished difference Result 18286 states and 25832 transitions. [2022-07-12 12:37:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:37:15,243 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 [2022-07-12 12:37:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:15,264 INFO L225 Difference]: With dead ends: 18286 [2022-07-12 12:37:15,264 INFO L226 Difference]: Without dead ends: 10621 [2022-07-12 12:37:15,274 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:15,274 INFO L413 NwaCegarLoop]: 1292 mSDtfsCounter, 1140 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 431 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 5786 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:15,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 5786 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 2937 Invalid, 4 Unknown, 0 Unchecked, 10.6s Time] [2022-07-12 12:37:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2022-07-12 12:37:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 7781. [2022-07-12 12:37:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7781 states, 6221 states have (on average 1.3806461983603922) internal successors, (8589), 6304 states have internal predecessors, (8589), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 542 states have return successors, (1188), 1056 states have call predecessors, (1188), 1016 states have call successors, (1188) [2022-07-12 12:37:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7781 states to 7781 states and 10794 transitions. [2022-07-12 12:37:15,612 INFO L78 Accepts]: Start accepts. Automaton has 7781 states and 10794 transitions. Word has length 274 [2022-07-12 12:37:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:15,613 INFO L495 AbstractCegarLoop]: Abstraction has 7781 states and 10794 transitions. [2022-07-12 12:37:15,613 INFO L496 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) [2022-07-12 12:37:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 10794 transitions. [2022-07-12 12:37:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-12 12:37:15,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:15,618 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:15,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 12:37:15,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2052785736, now seen corresponding path program 1 times [2022-07-12 12:37:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130049451] [2022-07-12 12:37:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:37:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:37:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:37:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:37:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:37:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:37:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:37:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:37:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:37:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:37:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:37:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:37:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:37:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:37:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:37:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:37:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 12:37:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:37:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 12:37:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 12:37:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-07-12 12:37:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:16,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130049451] [2022-07-12 12:37:16,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130049451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:37:16,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:37:16,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 12:37:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220273449] [2022-07-12 12:37:16,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:37:16,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 12:37:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:37:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 12:37:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:37:16,192 INFO L87 Difference]: Start difference. First operand 7781 states and 10794 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) [2022-07-12 12:37:21,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:23,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:28,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:30,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:33,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:35,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:37:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:37:35,347 INFO L93 Difference]: Finished difference Result 22431 states and 32470 transitions. [2022-07-12 12:37:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:37:35,348 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 [2022-07-12 12:37:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:37:35,394 INFO L225 Difference]: With dead ends: 22431 [2022-07-12 12:37:35,395 INFO L226 Difference]: Without dead ends: 14730 [2022-07-12 12:37:35,414 INFO L412 NwaCegarLoop]: 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 [2022-07-12 12:37:35,415 INFO L413 NwaCegarLoop]: 1541 mSDtfsCounter, 2071 mSDsluCounter, 13322 mSDsCounter, 0 mSdLazyCounter, 7951 mSolverCounterSat, 581 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 14863 SdHoareTripleChecker+Invalid, 8538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 7951 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:37:35,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 14863 Invalid, 8538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 7951 Invalid, 6 Unknown, 0 Unchecked, 18.1s Time] [2022-07-12 12:37:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-07-12 12:37:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 7811. [2022-07-12 12:37:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 6245 states have (on average 1.37822257806245) internal successors, (8607), 6328 states have internal predecessors, (8607), 1017 states have call successors, (1017), 486 states have call predecessors, (1017), 548 states have return successors, (1194), 1062 states have call predecessors, (1194), 1016 states have call successors, (1194) [2022-07-12 12:37:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 10818 transitions. [2022-07-12 12:37:35,932 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 10818 transitions. Word has length 275 [2022-07-12 12:37:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:37:35,933 INFO L495 AbstractCegarLoop]: Abstraction has 7811 states and 10818 transitions. [2022-07-12 12:37:35,933 INFO L496 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) [2022-07-12 12:37:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 10818 transitions. [2022-07-12 12:37:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-12 12:37:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:37:35,939 INFO L195 NwaCegarLoop]: 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] [2022-07-12 12:37:35,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 12:37:35,940 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:37:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:37:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -580629637, now seen corresponding path program 1 times [2022-07-12 12:37:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:37:35,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057964354] [2022-07-12 12:37:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:37:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:37:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:37:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:37:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:37:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:37:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:37:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:37:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:37:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:37:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:37:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:37:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:37:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:37:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 12:37:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:37:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:37:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:37:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:37:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 12:37:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:37:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:37:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 12:37:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:37:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 12:37:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:37:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-12 12:37:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-12 12:37:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:37:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057964354] [2022-07-12 12:37:38,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057964354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:37:38,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584665570] [2022-07-12 12:37:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:37:38,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:37:38,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:37:38,219 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) [2022-07-12 12:37:38,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 12:37:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:37:39,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 186 conjunts are in the unsatisfiable core [2022-07-12 12:37:39,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:37:40,034 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 12:37:40,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-07-12 12:37:40,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:37:40,170 INFO L390 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 19 treesize of output 23 [2022-07-12 12:37:40,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 12:37:40,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:40,553 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-12 12:37:40,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 37 [2022-07-12 12:37:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:42,388 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 12:37:42,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2022-07-12 12:37:43,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:43,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:43,678 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 12:37:43,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2022-07-12 12:37:44,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:44,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:44,208 INFO L356 Elim1Store]: treesize reduction 94, result has 43.0 percent of original size [2022-07-12 12:37:44,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 54 treesize of output 110 [2022-07-12 12:37:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:44,705 INFO L356 Elim1Store]: treesize reduction 46, result has 51.6 percent of original size [2022-07-12 12:37:44,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 111 [2022-07-12 12:37:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:45,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 12:37:45,222 INFO L356 Elim1Store]: treesize reduction 33, result has 47.6 percent of original size [2022-07-12 12:37:45,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 64 [2022-07-12 12:37:45,237 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 12:37:45,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 12:37:46,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 12:37:46,073 INFO L390 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 70 treesize of output 44 [2022-07-12 12:37:46,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 12:37:46,693 INFO L390 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 [2022-07-12 12:37:46,815 INFO L390 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 5 treesize of output 3 [2022-07-12 12:37:51,340 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 12:37:51,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-07-12 12:37:53,577 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 12:37:53,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 12:37:53,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 12:37:53,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 12:37:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 31 proven. 57 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-12 12:37:54,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:38:20,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ppp_async_input_~skb~2#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-12 12:38:20,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#res#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-12 12:38:20,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3584 (Array Int Int)) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_ppp_async_input_~ap#1.base| v_ArrVal_3584) |c_ULTIMATE.start_ldv_dev_alloc_skb_18_#t~ret387#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)) is different from false [2022-07-12 12:38:20,460 INFO L390 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 72 treesize of output 64 [2022-07-12 12:38:20,466 INFO L390 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 136 treesize of output 120 [2022-07-12 12:38:20,615 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_3584 (Array Int Int)) (|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (or (< |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| |c_#StackHeapBarrier|) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| v_ArrVal_3584) |c_ldv_skb_alloc_#res#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0))) (forall ((v_ArrVal_3584 (Array Int Int)) (|v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| Int) (|ULTIMATE.start_ppp_async_input_~skb~2#1.offset| Int)) (or (= (select |c_old(#valid)| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2|) 0) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_ppp_async_input_~ap#1.base_BEFORE_CALL_2| v_ArrVal_3584) |c_ldv_skb_alloc_#res#1.base|) (+ |ULTIMATE.start_ppp_async_input_~skb~2#1.offset| 104)) 4294967296) 0)))) (and (= (select |c_old(#valid)| |c_~#set_impl~0.base|) 0) (< |c_~#set_impl~0.base| |c_#StackHeapBarrier|))) is different from false [2022-07-12 12:38:21,246 INFO L390 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 32 treesize of output 28 [2022-07-12 12:38:21,250 INFO L390 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 63 treesize of output 55 [2022-07-12 12:38:21,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 12:38:21,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 12:38:21,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584665570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:38:21,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:38:21,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 41] total 76 [2022-07-12 12:38:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645203170] [2022-07-12 12:38:21,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:38:21,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-12 12:38:21,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:38:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-12 12:38:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=6473, Unknown=32, NotChecked=660, Total=7482 [2022-07-12 12:38:21,432 INFO L87 Difference]: Start difference. First operand 7811 states and 10818 transitions. Second operand has 76 states, 74 states have (on average 4.405405405405405) internal successors, (326), 63 states have internal predecessors, (326), 23 states have call successors, (57), 11 states have call predecessors, (57), 15 states have return successors, (56), 24 states have call predecessors, (56), 23 states have call successors, (56)