./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.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 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 00:13:26,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:13:26,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:13:26,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:13:26,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:13:26,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:13:26,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:13:26,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:13:26,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:13:26,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:13:26,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:13:26,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:13:26,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:13:26,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:13:26,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:13:26,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:13:26,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:13:26,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:13:26,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:13:26,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:13:26,812 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:13:26,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:13:26,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:13:26,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:13:26,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:13:26,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:13:26,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:13:26,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:13:26,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:13:26,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:13:26,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:13:26,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:13:26,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:13:26,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:13:26,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:13:26,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:13:26,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:13:26,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:13:26,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:13:26,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:13:26,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:13:26,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:13:26,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:13:26,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:13:26,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:13:26,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:13:26,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:13:26,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:13:26,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:13:26,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:13:26,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:13:26,853 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:13:26,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:13:26,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:13:26,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:13:26,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:13:26,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:13:26,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:13:26,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:13:26,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:13:26,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:13:26,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:13:26,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:13:26,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:13:26,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:13:26,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:13:26,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:13:26,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:13:26,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:13:26,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:13:26,858 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:13:26,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:13:26,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:13:26,858 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 -> 793a6c625c75092f747de022bbd4fd421346f4483d489a12fa5057c55b9e4cfa [2022-07-20 00:13:27,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:13:27,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:13:27,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:13:27,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:13:27,138 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:13:27,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-20 00:13:27,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16ae0dd3/10887a8c98484fe2aebe8b2194e88b5c/FLAGc5ebf2848 [2022-07-20 00:13:27,836 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:13:27,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-20 00:13:27,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16ae0dd3/10887a8c98484fe2aebe8b2194e88b5c/FLAGc5ebf2848 [2022-07-20 00:13:28,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16ae0dd3/10887a8c98484fe2aebe8b2194e88b5c [2022-07-20 00:13:28,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:13:28,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:13:28,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:13:28,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:13:28,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:13:28,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:13:28" (1/1) ... [2022-07-20 00:13:28,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2530ea63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:28, skipping insertion in model container [2022-07-20 00:13:28,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:13:28" (1/1) ... [2022-07-20 00:13:28,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:13:28,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:13:28,891 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-20 00:13:28,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:13:28,937 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:13:29,186 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i[135044,135057] [2022-07-20 00:13:29,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:13:29,247 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:13:29,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29 WrapperNode [2022-07-20 00:13:29,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:13:29,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:13:29,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:13:29,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:13:29,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,362 INFO L137 Inliner]: procedures = 114, calls = 417, calls flagged for inlining = 49, calls inlined = 46, statements flattened = 1211 [2022-07-20 00:13:29,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:13:29,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:13:29,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:13:29,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:13:29,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:13:29,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:13:29,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:13:29,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:13:29,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (1/1) ... [2022-07-20 00:13:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:13:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:13:29,505 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-20 00:13:29,559 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-20 00:13:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure raw_open [2022-07-20 00:13:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_open [2022-07-20 00:13:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-20 00:13:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-20 00:13:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:13:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:13:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:13:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 00:13:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 00:13:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_read_iter [2022-07-20 00:13:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_read_iter [2022-07-20 00:13:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:13:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:13:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-20 00:13:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-20 00:13:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure bind_get [2022-07-20 00:13:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_get [2022-07-20 00:13:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:13:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-20 00:13:29,580 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-20 00:13:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-20 00:13:29,580 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-20 00:13:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:13:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:13:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:13:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:13:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure bind_set [2022-07-20 00:13:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bind_set [2022-07-20 00:13:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-20 00:13:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-20 00:13:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 00:13:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 00:13:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:13:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:13:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:13:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-20 00:13:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-20 00:13:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:13:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 00:13:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 00:13:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-20 00:13:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-20 00:13:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:13:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:13:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_fsync [2022-07-20 00:13:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_fsync [2022-07-20 00:13:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2022-07-20 00:13:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2022-07-20 00:13:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-20 00:13:29,586 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-20 00:13:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-20 00:13:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-20 00:13:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-20 00:13:29,588 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-20 00:13:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_write_iter [2022-07-20 00:13:29,589 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_write_iter [2022-07-20 00:13:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:13:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:13:29,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:13:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 00:13:29,590 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 00:13:29,995 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:13:29,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:13:30,275 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:13:30,756 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:13:30,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:13:30,768 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:13:30,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:13:30 BoogieIcfgContainer [2022-07-20 00:13:30,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:13:30,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:13:30,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:13:30,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:13:30,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:13:28" (1/3) ... [2022-07-20 00:13:30,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3e9a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:13:30, skipping insertion in model container [2022-07-20 00:13:30,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:13:29" (2/3) ... [2022-07-20 00:13:30,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3e9a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:13:30, skipping insertion in model container [2022-07-20 00:13:30,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:13:30" (3/3) ... [2022-07-20 00:13:30,800 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--char--raw.ko-entry_point.cil.out.i [2022-07-20 00:13:30,813 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:13:30,813 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:13:30,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:13:30,872 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@93e6c67, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54d71237 [2022-07-20 00:13:30,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:13:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-20 00:13:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-20 00:13:30,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:30,897 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:30,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -837597320, now seen corresponding path program 1 times [2022-07-20 00:13:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:30,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184990221] [2022-07-20 00:13:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 00:13:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 00:13:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:13:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-20 00:13:31,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:31,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184990221] [2022-07-20 00:13:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184990221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:31,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:31,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:13:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268116484] [2022-07-20 00:13:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:31,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:13:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:13:31,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:13:31,981 INFO L87 Difference]: Start difference. First operand has 385 states, 278 states have (on average 1.341726618705036) internal successors, (373), 287 states have internal predecessors, (373), 79 states have call successors, (79), 27 states have call predecessors, (79), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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-20 00:13:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:33,297 INFO L93 Difference]: Finished difference Result 1122 states and 1580 transitions. [2022-07-20 00:13:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:13:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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 178 [2022-07-20 00:13:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:33,329 INFO L225 Difference]: With dead ends: 1122 [2022-07-20 00:13:33,329 INFO L226 Difference]: Without dead ends: 726 [2022-07-20 00:13:33,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:33,351 INFO L413 NwaCegarLoop]: 548 mSDtfsCounter, 879 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:33,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1535 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 00:13:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-20 00:13:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 661. [2022-07-20 00:13:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3394683026584866) internal successors, (655), 493 states have internal predecessors, (655), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-20 00:13:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 897 transitions. [2022-07-20 00:13:33,492 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 897 transitions. Word has length 178 [2022-07-20 00:13:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:33,493 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 897 transitions. [2022-07-20 00:13:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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-20 00:13:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 897 transitions. [2022-07-20 00:13:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-20 00:13:33,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:33,501 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:33,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:13:33,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:33,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 210178479, now seen corresponding path program 1 times [2022-07-20 00:13:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:33,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226142129] [2022-07-20 00:13:33,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:33,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-20 00:13:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:33,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226142129] [2022-07-20 00:13:33,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226142129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:33,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:33,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559843981] [2022-07-20 00:13:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:33,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:33,882 INFO L87 Difference]: Start difference. First operand 661 states and 897 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-20 00:13:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:34,694 INFO L93 Difference]: Finished difference Result 1368 states and 1876 transitions. [2022-07-20 00:13:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:13:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 177 [2022-07-20 00:13:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:34,701 INFO L225 Difference]: With dead ends: 1368 [2022-07-20 00:13:34,701 INFO L226 Difference]: Without dead ends: 757 [2022-07-20 00:13:34,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:13:34,704 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 724 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:34,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1291 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:13:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-20 00:13:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 661. [2022-07-20 00:13:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 489 states have (on average 1.3374233128834356) internal successors, (654), 493 states have internal predecessors, (654), 122 states have call successors, (122), 50 states have call predecessors, (122), 49 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-07-20 00:13:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 896 transitions. [2022-07-20 00:13:34,770 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 896 transitions. Word has length 177 [2022-07-20 00:13:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:34,773 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 896 transitions. [2022-07-20 00:13:34,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-20 00:13:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 896 transitions. [2022-07-20 00:13:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-20 00:13:34,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:34,777 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:34,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:13:34,778 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1478765263, now seen corresponding path program 1 times [2022-07-20 00:13:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295363809] [2022-07-20 00:13:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-20 00:13:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295363809] [2022-07-20 00:13:35,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295363809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:35,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:35,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369427529] [2022-07-20 00:13:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:35,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:35,107 INFO L87 Difference]: Start difference. First operand 661 states and 896 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 00:13:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:36,195 INFO L93 Difference]: Finished difference Result 2068 states and 2847 transitions. [2022-07-20 00:13:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:13:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 177 [2022-07-20 00:13:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:36,204 INFO L225 Difference]: With dead ends: 2068 [2022-07-20 00:13:36,204 INFO L226 Difference]: Without dead ends: 1441 [2022-07-20 00:13:36,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:13:36,208 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 1029 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:36,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1472 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 00:13:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-07-20 00:13:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1253. [2022-07-20 00:13:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 936 states have (on average 1.3461538461538463) internal successors, (1260), 945 states have internal predecessors, (1260), 221 states have call successors, (221), 94 states have call predecessors, (221), 95 states have return successors, (227), 219 states have call predecessors, (227), 219 states have call successors, (227) [2022-07-20 00:13:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1708 transitions. [2022-07-20 00:13:36,302 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1708 transitions. Word has length 177 [2022-07-20 00:13:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1708 transitions. [2022-07-20 00:13:36,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 00:13:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1708 transitions. [2022-07-20 00:13:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-20 00:13:36,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:36,308 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:36,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:13:36,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1465783967, now seen corresponding path program 1 times [2022-07-20 00:13:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192568747] [2022-07-20 00:13:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 00:13:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 00:13:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-20 00:13:36,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192568747] [2022-07-20 00:13:36,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192568747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:36,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:36,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:13:36,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225135369] [2022-07-20 00:13:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:36,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:13:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:36,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:13:36,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:13:36,607 INFO L87 Difference]: Start difference. First operand 1253 states and 1708 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 00:13:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:37,409 INFO L93 Difference]: Finished difference Result 3258 states and 4422 transitions. [2022-07-20 00:13:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:13:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 200 [2022-07-20 00:13:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:37,421 INFO L225 Difference]: With dead ends: 3258 [2022-07-20 00:13:37,422 INFO L226 Difference]: Without dead ends: 2055 [2022-07-20 00:13:37,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:37,429 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 664 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:37,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 00:13:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-07-20 00:13:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1833. [2022-07-20 00:13:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1376 states have (on average 1.340843023255814) internal successors, (1845), 1388 states have internal predecessors, (1845), 310 states have call successors, (310), 145 states have call predecessors, (310), 146 states have return successors, (316), 307 states have call predecessors, (316), 308 states have call successors, (316) [2022-07-20 00:13:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2471 transitions. [2022-07-20 00:13:37,534 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2471 transitions. Word has length 200 [2022-07-20 00:13:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:37,535 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2471 transitions. [2022-07-20 00:13:37,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 00:13:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2471 transitions. [2022-07-20 00:13:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-20 00:13:37,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:37,542 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:37,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:13:37,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1995507625, now seen corresponding path program 1 times [2022-07-20 00:13:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:37,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181068058] [2022-07-20 00:13:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:13:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:13:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-20 00:13:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-20 00:13:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-20 00:13:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181068058] [2022-07-20 00:13:37,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181068058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:37,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:37,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017661847] [2022-07-20 00:13:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:37,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:37,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:37,880 INFO L87 Difference]: Start difference. First operand 1833 states and 2471 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 00:13:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:38,567 INFO L93 Difference]: Finished difference Result 3196 states and 4288 transitions. [2022-07-20 00:13:38,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:13:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 267 [2022-07-20 00:13:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:38,575 INFO L225 Difference]: With dead ends: 3196 [2022-07-20 00:13:38,575 INFO L226 Difference]: Without dead ends: 1411 [2022-07-20 00:13:38,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:38,580 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 325 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:38,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1445 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 00:13:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-20 00:13:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1215. [2022-07-20 00:13:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 898 states have (on average 1.3140311804008908) internal successors, (1180), 907 states have internal predecessors, (1180), 211 states have call successors, (211), 105 states have call predecessors, (211), 105 states have return successors, (213), 208 states have call predecessors, (213), 209 states have call successors, (213) [2022-07-20 00:13:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1604 transitions. [2022-07-20 00:13:38,676 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1604 transitions. Word has length 267 [2022-07-20 00:13:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:38,677 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1604 transitions. [2022-07-20 00:13:38,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 00:13:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1604 transitions. [2022-07-20 00:13:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-20 00:13:38,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:38,682 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:38,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:13:38,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:38,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1551606951, now seen corresponding path program 1 times [2022-07-20 00:13:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:38,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342266294] [2022-07-20 00:13:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:13:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:13:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-20 00:13:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-20 00:13:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-20 00:13:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342266294] [2022-07-20 00:13:39,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342266294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:39,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:39,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487694499] [2022-07-20 00:13:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:39,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:39,013 INFO L87 Difference]: Start difference. First operand 1215 states and 1604 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-20 00:13:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:40,019 INFO L93 Difference]: Finished difference Result 2898 states and 3833 transitions. [2022-07-20 00:13:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:13:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 267 [2022-07-20 00:13:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:40,029 INFO L225 Difference]: With dead ends: 2898 [2022-07-20 00:13:40,030 INFO L226 Difference]: Without dead ends: 1848 [2022-07-20 00:13:40,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:13:40,034 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 667 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:40,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1904 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 00:13:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-07-20 00:13:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1575. [2022-07-20 00:13:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1174 states have (on average 1.3160136286201023) internal successors, (1545), 1183 states have internal predecessors, (1545), 263 states have call successors, (263), 137 states have call predecessors, (263), 137 states have return successors, (265), 260 states have call predecessors, (265), 261 states have call successors, (265) [2022-07-20 00:13:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2073 transitions. [2022-07-20 00:13:40,110 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2073 transitions. Word has length 267 [2022-07-20 00:13:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:40,111 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2073 transitions. [2022-07-20 00:13:40,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-20 00:13:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2073 transitions. [2022-07-20 00:13:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-07-20 00:13:40,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:40,117 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:40,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:13:40,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -350932392, now seen corresponding path program 1 times [2022-07-20 00:13:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:40,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611122205] [2022-07-20 00:13:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:13:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:13:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 00:13:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 00:13:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-20 00:13:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-07-20 00:13:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:40,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611122205] [2022-07-20 00:13:40,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611122205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:40,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:40,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 00:13:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804715799] [2022-07-20 00:13:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:40,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 00:13:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 00:13:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:13:40,582 INFO L87 Difference]: Start difference. First operand 1575 states and 2073 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 00:13:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:42,539 INFO L93 Difference]: Finished difference Result 4803 states and 6330 transitions. [2022-07-20 00:13:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:13:42,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 286 [2022-07-20 00:13:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:42,556 INFO L225 Difference]: With dead ends: 4803 [2022-07-20 00:13:42,556 INFO L226 Difference]: Without dead ends: 3393 [2022-07-20 00:13:42,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-20 00:13:42,562 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 823 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:42,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3980 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-20 00:13:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-07-20 00:13:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2675. [2022-07-20 00:13:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2007 states have (on average 1.3248629795714997) internal successors, (2659), 2026 states have internal predecessors, (2659), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-20 00:13:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3541 transitions. [2022-07-20 00:13:42,723 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3541 transitions. Word has length 286 [2022-07-20 00:13:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:42,724 INFO L495 AbstractCegarLoop]: Abstraction has 2675 states and 3541 transitions. [2022-07-20 00:13:42,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 00:13:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3541 transitions. [2022-07-20 00:13:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-20 00:13:42,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:42,733 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:42,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:13:42,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 311520253, now seen corresponding path program 1 times [2022-07-20 00:13:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:42,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942457280] [2022-07-20 00:13:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:13:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:13:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:13:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 00:13:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 00:13:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-20 00:13:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-20 00:13:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2022-07-20 00:13:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:43,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942457280] [2022-07-20 00:13:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942457280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:43,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:43,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:13:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098087474] [2022-07-20 00:13:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:13:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:13:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:13:43,265 INFO L87 Difference]: Start difference. First operand 2675 states and 3541 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-20 00:13:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:44,139 INFO L93 Difference]: Finished difference Result 5643 states and 7511 transitions. [2022-07-20 00:13:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:13:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 306 [2022-07-20 00:13:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:44,154 INFO L225 Difference]: With dead ends: 5643 [2022-07-20 00:13:44,155 INFO L226 Difference]: Without dead ends: 3133 [2022-07-20 00:13:44,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:44,162 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 467 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:44,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1646 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 00:13:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-07-20 00:13:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2703. [2022-07-20 00:13:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2035 states have (on average 1.3282555282555282) internal successors, (2703), 2054 states have internal predecessors, (2703), 432 states have call successors, (432), 225 states have call predecessors, (432), 235 states have return successors, (450), 431 states have call predecessors, (450), 430 states have call successors, (450) [2022-07-20 00:13:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3585 transitions. [2022-07-20 00:13:44,331 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3585 transitions. Word has length 306 [2022-07-20 00:13:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 3585 transitions. [2022-07-20 00:13:44,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-20 00:13:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3585 transitions. [2022-07-20 00:13:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-20 00:13:44,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:44,339 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:44,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:13:44,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1101263580, now seen corresponding path program 1 times [2022-07-20 00:13:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971203444] [2022-07-20 00:13:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:13:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:13:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:13:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 00:13:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 00:13:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-20 00:13:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-20 00:13:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-07-20 00:13:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:44,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971203444] [2022-07-20 00:13:44,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971203444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:13:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508390068] [2022-07-20 00:13:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:13:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:13:44,751 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-20 00:13:44,763 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-20 00:13:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:45,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 2457 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 00:13:45,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:13:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-20 00:13:45,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:13:45,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508390068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:45,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:13:45,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-20 00:13:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334494793] [2022-07-20 00:13:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:45,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:13:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:13:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:13:45,513 INFO L87 Difference]: Start difference. First operand 2703 states and 3585 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-20 00:13:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:45,667 INFO L93 Difference]: Finished difference Result 4225 states and 5561 transitions. [2022-07-20 00:13:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:13:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 305 [2022-07-20 00:13:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:45,678 INFO L225 Difference]: With dead ends: 4225 [2022-07-20 00:13:45,679 INFO L226 Difference]: Without dead ends: 1646 [2022-07-20 00:13:45,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-20 00:13:45,687 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 20 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:45,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2015 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 00:13:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-07-20 00:13:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1547. [2022-07-20 00:13:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1152 states have (on average 1.3159722222222223) internal successors, (1516), 1164 states have internal predecessors, (1516), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-20 00:13:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2022-07-20 00:13:45,773 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 305 [2022-07-20 00:13:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:45,774 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2022-07-20 00:13:45,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 3 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-20 00:13:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2022-07-20 00:13:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-20 00:13:45,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:45,781 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:45,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 00:13:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:13:46,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash -191141444, now seen corresponding path program 1 times [2022-07-20 00:13:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:46,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40629517] [2022-07-20 00:13:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:13:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 00:13:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 00:13:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:13:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:13:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:13:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:13:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:13:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:13:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:13:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:13:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:13:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:13:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:13:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 00:13:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 00:13:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-20 00:13:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 00:13:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 00:13:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-20 00:13:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2022-07-20 00:13:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:46,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40629517] [2022-07-20 00:13:46,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40629517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:13:46,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599562098] [2022-07-20 00:13:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:46,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:13:46,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:13:46,462 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-20 00:13:46,463 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-20 00:13:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:47,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 00:13:47,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:13:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-07-20 00:13:47,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:13:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599562098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:47,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:13:47,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-07-20 00:13:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397189029] [2022-07-20 00:13:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:47,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:13:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:13:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:13:47,298 INFO L87 Difference]: Start difference. First operand 1547 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-20 00:13:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:47,403 INFO L93 Difference]: Finished difference Result 3072 states and 4060 transitions. [2022-07-20 00:13:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:13:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 317 [2022-07-20 00:13:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:47,411 INFO L225 Difference]: With dead ends: 3072 [2022-07-20 00:13:47,411 INFO L226 Difference]: Without dead ends: 1548 [2022-07-20 00:13:47,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:13:47,416 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 3 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:47,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 00:13:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-20 00:13:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2022-07-20 00:13:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1153 states have (on average 1.3156981786643538) internal successors, (1517), 1165 states have internal predecessors, (1517), 257 states have call successors, (257), 133 states have call predecessors, (257), 137 states have return successors, (264), 252 states have call predecessors, (264), 255 states have call successors, (264) [2022-07-20 00:13:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2038 transitions. [2022-07-20 00:13:47,495 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2038 transitions. Word has length 317 [2022-07-20 00:13:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:47,495 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2038 transitions. [2022-07-20 00:13:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-20 00:13:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2038 transitions. [2022-07-20 00:13:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-20 00:13:47,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:47,502 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:13:47,534 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-20 00:13:47,722 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-20 00:13:47,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash 931062163, now seen corresponding path program 1 times [2022-07-20 00:13:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:47,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053938545] [2022-07-20 00:13:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:13:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 00:13:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 00:13:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 00:13:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:13:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 00:13:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 00:13:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:13:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 00:13:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:13:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 00:13:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:13:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 00:13:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:13:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:13:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 00:13:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 00:13:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-20 00:13:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-20 00:13:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-20 00:13:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-20 00:13:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:13:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-20 00:13:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2022-07-20 00:13:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053938545] [2022-07-20 00:13:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053938545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:13:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615602872] [2022-07-20 00:13:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:13:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:13:48,267 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-20 00:13:48,294 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-20 00:13:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:49,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 319 conjunts are in the unsatisfiable core [2022-07-20 00:13:49,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:13:49,131 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-07-20 00:13:49,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 262 treesize of output 244 [2022-07-20 00:13:51,307 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 11 treesize of output 7 [2022-07-20 00:13:51,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:13:52,025 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2251 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2251) |c_#memory_int|))) is different from true [2022-07-20 00:13:52,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:13:52,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:13:52,449 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2252 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2252) |c_#memory_int|))) is different from true [2022-07-20 00:13:52,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:13:52,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:13:52,760 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2253 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2253) |c_#memory_int|))) is different from true [2022-07-20 00:13:52,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:13:52,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:13:53,009 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2254 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2254)))) is different from true [2022-07-20 00:13:53,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:13:53,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:08,143 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 00:14:08,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 00:14:09,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:09,433 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2257 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2257) |c_#memory_int|))) is different from true [2022-07-20 00:14:09,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:11,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:11,618 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 00:14:11,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 00:14:12,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:12,731 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2260 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2260)))) is different from true [2022-07-20 00:14:12,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:13,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:13,731 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2261 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2261) |c_#memory_int|))) is different from true [2022-07-20 00:14:13,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:15,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:15,814 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2262 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2262) |c_#memory_int|))) is different from true [2022-07-20 00:14:15,833 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 14 treesize of output 16 [2022-07-20 00:14:17,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:17,899 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2263 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2263) |c_#memory_int|))) is different from true [2022-07-20 00:14:17,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:22,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:23,193 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2264) |c_#memory_int|))) is different from true [2022-07-20 00:14:23,209 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| v_ArrVal_2264)) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| |c_#StackHeapBarrier|)))) is different from true [2022-07-20 00:14:23,220 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 6 treesize of output 5 [2022-07-20 00:14:23,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:14:23,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:23,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:23,293 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2265 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2265) |c_#memory_int|))) is different from true [2022-07-20 00:14:24,927 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 6 treesize of output 5 [2022-07-20 00:14:25,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:14:25,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:26,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:14:26,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:26,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:14:26,362 WARN L855 $PredicateComparison]: unable to prove that (exists ((|raw_open_~filp#1.base| Int)) (and (<= |raw_open_~filp#1.base| |c_raw_open_#in~filp#1.base|) (exists ((v_ArrVal_2267 (Array Int Int))) (= (store |c_old(#memory_int)| |raw_open_~filp#1.base| v_ArrVal_2267) |c_#memory_int|)))) is different from true [2022-07-20 00:14:26,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:14:26,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:14:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 87 proven. 101 refuted. 10 times theorem prover too weak. 223 trivial. 403 not checked. [2022-07-20 00:14:26,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:14:26,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2270 (Array Int Int)) (|v_raw_open_~filp#1.base_10| Int)) (or (< c_~raw_ctl_fops_group2~0.base |v_raw_open_~filp#1.base_10|) (not (= (select (select (store |c_#memory_int| |v_raw_open_~filp#1.base_10| v_ArrVal_2270) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032)))) is different from false [2022-07-20 00:14:26,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615602872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:14:26,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:14:26,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 52] total 59 [2022-07-20 00:14:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392380395] [2022-07-20 00:14:26,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:14:26,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-20 00:14:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:14:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-20 00:14:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1891, Unknown=44, NotChecked=1442, Total=3660 [2022-07-20 00:14:26,601 INFO L87 Difference]: Start difference. First operand 1548 states and 2038 transitions. Second operand has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-20 00:14:29,155 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| v_ArrVal_2264)) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| |c_#StackHeapBarrier|))) (< |c_ldv_init_zalloc_#t~malloc23.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2265 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| Int)) (and (<= |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| |c_ldv_init_zalloc_#t~malloc23.base|) (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| v_ArrVal_2265) |c_#memory_int|)))) is different from true [2022-07-20 00:14:30,110 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2264 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| v_ArrVal_2264)) (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_17| |c_#StackHeapBarrier|))) (< |c_ldv_init_zalloc_#res.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2265 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| Int)) (and (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| |c_#StackHeapBarrier|) (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_18| v_ArrVal_2265) |c_#memory_int|)))) is different from true [2022-07-20 00:14:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:46,599 INFO L93 Difference]: Finished difference Result 3554 states and 4698 transitions. [2022-07-20 00:14:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 00:14:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) Word has length 331 [2022-07-20 00:14:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:46,610 INFO L225 Difference]: With dead ends: 3554 [2022-07-20 00:14:46,610 INFO L226 Difference]: Without dead ends: 2032 [2022-07-20 00:14:46,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 423 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=507, Invalid=4292, Unknown=95, NotChecked=2416, Total=7310 [2022-07-20 00:14:46,617 INFO L413 NwaCegarLoop]: 636 mSDtfsCounter, 554 mSDsluCounter, 7714 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 16474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11956 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:46,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 8350 Invalid, 16474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4189 Invalid, 0 Unknown, 11956 Unchecked, 3.1s Time] [2022-07-20 00:14:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-07-20 00:14:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1742. [2022-07-20 00:14:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1293 states have (on average 1.308584686774942) internal successors, (1692), 1308 states have internal predecessors, (1692), 292 states have call successors, (292), 149 states have call predecessors, (292), 156 states have return successors, (318), 287 states have call predecessors, (318), 290 states have call successors, (318) [2022-07-20 00:14:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2302 transitions. [2022-07-20 00:14:46,734 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2302 transitions. Word has length 331 [2022-07-20 00:14:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:46,734 INFO L495 AbstractCegarLoop]: Abstraction has 1742 states and 2302 transitions. [2022-07-20 00:14:46,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 5.068965517241379) internal successors, (294), 50 states have internal predecessors, (294), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-20 00:14:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2302 transitions. [2022-07-20 00:14:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-07-20 00:14:46,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:46,741 INFO L195 NwaCegarLoop]: trace histogram [17, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:14:46,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 00:14:46,963 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-20 00:14:46,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -310214994, now seen corresponding path program 2 times [2022-07-20 00:14:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:46,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364463331] [2022-07-20 00:14:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:14:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:14:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:14:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:14:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-20 00:14:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 00:14:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 00:14:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 00:14:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:14:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 00:14:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:14:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 00:14:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:14:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 00:14:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:14:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 00:14:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:14:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:14:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-20 00:14:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 00:14:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-20 00:14:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-20 00:14:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-20 00:14:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-20 00:14:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:14:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-07-20 00:14:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-07-20 00:14:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:47,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364463331] [2022-07-20 00:14:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364463331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:14:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169754204] [2022-07-20 00:14:47,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:14:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:14:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:14:47,667 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-20 00:14:47,669 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-20 00:14:48,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 00:14:48,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:14:48,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2789 conjuncts, 371 conjunts are in the unsatisfiable core [2022-07-20 00:14:48,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:14:50,912 INFO L356 Elim1Store]: treesize reduction 960, result has 38.5 percent of original size [2022-07-20 00:14:50,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 105 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 195 case distinctions, treesize of input 362 treesize of output 912 [2022-07-20 00:15:14,080 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 11 treesize of output 7 [2022-07-20 00:15:14,123 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 00:15:14,123 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 21 treesize of output 20 [2022-07-20 00:15:20,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:15:20,289 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2939 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2939)))) is different from true [2022-07-20 00:15:21,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:15:24,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:15:40,826 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 00:15:40,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 00:15:47,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:15:47,351 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2942 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2942) |c_#memory_int|))) is different from true [2022-07-20 00:15:48,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:15:52,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:15:53,456 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2944 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2944) |c_#memory_int|))) is different from true [2022-07-20 00:15:53,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 43 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:15:58,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:15:58,225 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 00:15:58,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 00:16:02,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:03,287 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2948 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2948) |c_#memory_int|))) is different from true [2022-07-20 00:16:03,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 41 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:05,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:05,767 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2949 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2949)))) is different from true [2022-07-20 00:16:06,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 39 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:08,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:08,366 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2950 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2950) |c_#memory_int|))) is different from true [2022-07-20 00:16:08,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 37 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:10,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:10,861 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2952 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2952) |c_#memory_int|))) is different from true [2022-07-20 00:16:10,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 35 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:13,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:14,211 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2954 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2954)))) is different from true [2022-07-20 00:16:14,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 33 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:16,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:16,538 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2955 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_2955) |c_#memory_int|))) is different from true [2022-07-20 00:16:16,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:22,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:23,436 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2956 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2956) |c_#memory_int|))) is different from true [2022-07-20 00:16:23,446 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2956 (Array Int Int)) (|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_23| Int)) (and (< |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_23| |c_#StackHeapBarrier|) (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_23| v_ArrVal_2956) |c_#memory_int|)))) is different from true [2022-07-20 00:16:23,453 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 6 treesize of output 5 [2022-07-20 00:16:23,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:16:23,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:23,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:23,565 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2957 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2957) |c_#memory_int|))) is different from true [2022-07-20 00:16:25,310 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 6 treesize of output 5 [2022-07-20 00:16:26,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:16:26,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:27,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:16:27,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:28,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:16:28,223 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2959 (Array Int Int))) (= (store |c_old(#memory_int)| |c_raw_open_#in~filp#1.base| v_ArrVal_2959) |c_#memory_int|)) is different from true [2022-07-20 00:16:28,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:16:28,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:16:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 87 proven. 154 refuted. 36 times theorem prover too weak. 229 trivial. 448 not checked. [2022-07-20 00:16:28,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:16:28,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2962 (Array Int Int))) (not (= (select (select (store |c_#memory_int| c_~raw_ctl_fops_group2~0.base v_ArrVal_2962) |c_ULTIMATE.start_main_~#ldvarg1~0#1.base|) |c_ULTIMATE.start_main_~#ldvarg1~0#1.offset|) 44032))) is different from false [2022-07-20 00:16:28,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169754204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:16:28,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:16:28,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 55] total 63 [2022-07-20 00:16:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919451420] [2022-07-20 00:16:28,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:16:28,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-20 00:16:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:16:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-20 00:16:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2265, Unknown=45, NotChecked=1554, Total=4160 [2022-07-20 00:16:28,871 INFO L87 Difference]: Start difference. First operand 1742 states and 2302 transitions. Second operand has 63 states, 62 states have (on average 4.790322580645161) internal successors, (297), 54 states have internal predecessors, (297), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-20 00:16:41,654 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2957 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2957) |c_#memory_int|)) (exists ((v_ArrVal_2956 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2956) |c_#memory_int|))) is different from true [2022-07-20 00:16:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:16:58,002 INFO L93 Difference]: Finished difference Result 3778 states and 5012 transitions. [2022-07-20 00:16:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 00:16:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 4.790322580645161) internal successors, (297), 54 states have internal predecessors, (297), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) Word has length 336 [2022-07-20 00:16:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:16:58,012 INFO L225 Difference]: With dead ends: 3778 [2022-07-20 00:16:58,012 INFO L226 Difference]: Without dead ends: 2062 [2022-07-20 00:16:58,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 420 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=546, Invalid=5423, Unknown=97, NotChecked=2490, Total=8556 [2022-07-20 00:16:58,018 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 638 mSDsluCounter, 6505 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 6962 SdHoareTripleChecker+Invalid, 12586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8707 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-20 00:16:58,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 6962 Invalid, 12586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 3415 Invalid, 0 Unknown, 8707 Unchecked, 3.8s Time] [2022-07-20 00:16:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-20 00:16:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1773. [2022-07-20 00:16:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1318 states have (on average 1.3088012139605463) internal successors, (1725), 1332 states have internal predecessors, (1725), 295 states have call successors, (295), 153 states have call predecessors, (295), 159 states have return successors, (327), 290 states have call predecessors, (327), 293 states have call successors, (327) [2022-07-20 00:16:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2347 transitions. [2022-07-20 00:16:58,140 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2347 transitions. Word has length 336 [2022-07-20 00:16:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:16:58,141 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2347 transitions. [2022-07-20 00:16:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 4.790322580645161) internal successors, (297), 54 states have internal predecessors, (297), 24 states have call successors, (73), 12 states have call predecessors, (73), 23 states have return successors, (71), 26 states have call predecessors, (71), 24 states have call successors, (71) [2022-07-20 00:16:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2347 transitions. [2022-07-20 00:16:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-07-20 00:16:58,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:16:58,158 INFO L195 NwaCegarLoop]: trace histogram [22, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:16:58,194 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-20 00:16:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:16:58,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:16:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:16:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -940608909, now seen corresponding path program 3 times [2022-07-20 00:16:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:16:58,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010687467] [2022-07-20 00:16:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:16:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:16:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:16:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:16:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:16:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:16:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:16:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-20 00:16:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 00:16:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 00:16:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 00:16:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:16:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 00:16:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:16:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:16:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:16:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:16:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:16:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 00:16:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:16:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:16:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:16:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-20 00:16:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-20 00:16:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-20 00:16:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 00:16:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 00:16:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-20 00:16:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:16:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-20 00:16:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-07-20 00:16:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:16:58,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010687467] [2022-07-20 00:16:58,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010687467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:16:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574250101] [2022-07-20 00:16:58,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 00:16:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:16:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:16:59,000 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-20 00:16:59,004 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-20 00:17:00,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 00:17:00,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:17:00,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 2038 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 00:17:00,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:17:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 241 proven. 1 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2022-07-20 00:17:00,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:17:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2022-07-20 00:17:00,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574250101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:17:00,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:17:00,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 6] total 19 [2022-07-20 00:17:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696087719] [2022-07-20 00:17:00,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:17:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 00:17:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:17:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 00:17:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-07-20 00:17:00,549 INFO L87 Difference]: Start difference. First operand 1773 states and 2347 transitions. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 14 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-20 00:17:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:17:02,502 INFO L93 Difference]: Finished difference Result 3774 states and 4999 transitions. [2022-07-20 00:17:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 00:17:02,502 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 14 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 341 [2022-07-20 00:17:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:17:02,513 INFO L225 Difference]: With dead ends: 3774 [2022-07-20 00:17:02,513 INFO L226 Difference]: Without dead ends: 2012 [2022-07-20 00:17:02,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 00:17:02,520 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 792 mSDsluCounter, 3090 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:17:02,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 3546 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 00:17:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-07-20 00:17:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1732. [2022-07-20 00:17:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1293 states have (on average 1.308584686774942) internal successors, (1692), 1308 states have internal predecessors, (1692), 282 states have call successors, (282), 150 states have call predecessors, (282), 156 states have return successors, (291), 276 states have call predecessors, (291), 280 states have call successors, (291) [2022-07-20 00:17:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2265 transitions. [2022-07-20 00:17:02,644 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2265 transitions. Word has length 341 [2022-07-20 00:17:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:17:02,645 INFO L495 AbstractCegarLoop]: Abstraction has 1732 states and 2265 transitions. [2022-07-20 00:17:02,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 14 states have internal predecessors, (195), 2 states have call successors, (75), 7 states have call predecessors, (75), 5 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2022-07-20 00:17:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2265 transitions. [2022-07-20 00:17:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-07-20 00:17:02,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:17:02,650 INFO L195 NwaCegarLoop]: trace histogram [48, 12, 12, 12, 12, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:17:02,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-20 00:17:02,875 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,SelfDestructingSolverStorable12 [2022-07-20 00:17:02,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:17:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:17:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash -298770021, now seen corresponding path program 4 times [2022-07-20 00:17:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:17:02,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809980310] [2022-07-20 00:17:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:17:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:17:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:17:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:17:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:17:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:17:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 00:17:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:17:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 00:17:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 00:17:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:17:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 00:17:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 00:17:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:17:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:17:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 00:17:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 00:17:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 00:17:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-20 00:17:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:17:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:17:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:17:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-20 00:17:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 00:17:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:17:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-20 00:17:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-20 00:17:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-07-20 00:17:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-20 00:17:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:17:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 00:17:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-20 00:17:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:17:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 28 proven. 290 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2022-07-20 00:17:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:17:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809980310] [2022-07-20 00:17:03,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809980310] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:17:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503406801] [2022-07-20 00:17:03,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 00:17:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:17:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:17:03,706 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-20 00:17:03,708 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-20 00:17:04,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 00:17:04,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:17:04,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 3254 conjuncts, 447 conjunts are in the unsatisfiable core [2022-07-20 00:17:04,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:17:04,765 INFO L356 Elim1Store]: treesize reduction 224, result has 0.4 percent of original size [2022-07-20 00:17:04,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 245 treesize of output 229 [2022-07-20 00:17:06,381 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 11 treesize of output 7 [2022-07-20 00:17:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:17:06,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 00:17:06,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:17:06,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 00:17:06,499 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 00:17:06,500 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 21 treesize of output 20 [2022-07-20 00:17:07,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:17:07,355 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_4881 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_4881) |c_#memory_int|))) is different from true [2022-07-20 00:17:07,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:17:07,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 00:17:07,902 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_4885 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s#1.base| v_ArrVal_4885) |c_#memory_int|))) is different from true [2022-07-20 00:17:07,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 00:17:08,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3