./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/heap-manipulation/dll_of_dll-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 22:21:52,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 22:21:52,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 22:21:52,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 22:21:52,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 22:21:52,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 22:21:52,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 22:21:52,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 22:21:52,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 22:21:52,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 22:21:52,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 22:21:52,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 22:21:52,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 22:21:52,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 22:21:52,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 22:21:52,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 22:21:52,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 22:21:52,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 22:21:52,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 22:21:52,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 22:21:52,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 22:21:52,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 22:21:52,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 22:21:52,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 22:21:52,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 22:21:52,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 22:21:52,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 22:21:52,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 22:21:52,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 22:21:52,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 22:21:52,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 22:21:52,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 22:21:52,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 22:21:52,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 22:21:52,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 22:21:52,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 22:21:52,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 22:21:52,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 22:21:52,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 22:21:52,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 22:21:52,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 22:21:52,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 22:21:52,532 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 22:21:52,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 22:21:52,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 22:21:52,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 22:21:52,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 22:21:52,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 22:21:52,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 22:21:52,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 22:21:52,535 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 22:21:52,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 22:21:52,536 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 22:21:52,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 22:21:52,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 22:21:52,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 22:21:52,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 22:21:52,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 22:21:52,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 22:21:52,537 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 22:21:52,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 22:21:52,538 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 22:21:52,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 22:21:52,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 22:21:52,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 22:21:52,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 22:21:52,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:21:52,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 22:21:52,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 22:21:52,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 22:21:52,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 22:21:52,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 22:21:52,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 22:21:52,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 22:21:52,540 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 22:21:52,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 22:21:52,540 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 22:21:52,541 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2023-02-17 22:21:52,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 22:21:52,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 22:21:52,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 22:21:52,809 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 22:21:52,809 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 22:21:52,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2023-02-17 22:21:53,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 22:21:54,187 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 22:21:54,187 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2023-02-17 22:21:54,220 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b15d2845/3f7cb07e61bc459c9059eadda74e5026/FLAGb101d3ce2 [2023-02-17 22:21:54,230 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b15d2845/3f7cb07e61bc459c9059eadda74e5026 [2023-02-17 22:21:54,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 22:21:54,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 22:21:54,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 22:21:54,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 22:21:54,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 22:21:54,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7ba290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54, skipping insertion in model container [2023-02-17 22:21:54,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 22:21:54,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 22:21:54,484 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-02-17 22:21:54,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:21:54,561 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 22:21:54,595 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2023-02-17 22:21:54,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:21:54,657 INFO L208 MainTranslator]: Completed translation [2023-02-17 22:21:54,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54 WrapperNode [2023-02-17 22:21:54,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 22:21:54,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 22:21:54,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 22:21:54,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 22:21:54,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,704 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2023-02-17 22:21:54,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 22:21:54,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 22:21:54,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 22:21:54,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 22:21:54,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,753 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 22:21:54,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 22:21:54,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 22:21:54,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 22:21:54,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (1/1) ... [2023-02-17 22:21:54,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:21:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:21:54,808 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) [2023-02-17 22:21:54,810 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 [2023-02-17 22:21:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-17 22:21:54,843 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-17 22:21:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-02-17 22:21:54,844 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-02-17 22:21:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 22:21:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 22:21:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-02-17 22:21:54,844 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 22:21:54,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 22:21:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 22:21:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-02-17 22:21:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-02-17 22:21:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-02-17 22:21:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-02-17 22:21:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 22:21:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 22:21:54,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 22:21:55,018 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 22:21:55,022 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 22:21:55,408 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 22:21:55,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 22:21:55,414 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2023-02-17 22:21:55,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:21:55 BoogieIcfgContainer [2023-02-17 22:21:55,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 22:21:55,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 22:21:55,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 22:21:55,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 22:21:55,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 10:21:54" (1/3) ... [2023-02-17 22:21:55,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:21:55, skipping insertion in model container [2023-02-17 22:21:55,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:21:54" (2/3) ... [2023-02-17 22:21:55,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:21:55, skipping insertion in model container [2023-02-17 22:21:55,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:21:55" (3/3) ... [2023-02-17 22:21:55,447 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2023-02-17 22:21:55,460 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 22:21:55,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 22:21:55,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 22:21:55,559 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ad2eba4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 22:21:55,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 22:21:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-17 22:21:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 22:21:55,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:21:55,571 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 22:21:55,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:21:55,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:21:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash 760908611, now seen corresponding path program 1 times [2023-02-17 22:21:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:21:55,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193776580] [2023-02-17 22:21:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:21:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:21:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:21:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:21:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:21:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 22:21:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 22:21:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193776580] [2023-02-17 22:21:55,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193776580] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 22:21:55,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 22:21:55,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 22:21:55,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550082435] [2023-02-17 22:21:55,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 22:21:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 22:21:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 22:21:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 22:21:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 22:21:55,978 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 22:21:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:21:56,198 INFO L93 Difference]: Finished difference Result 251 states and 429 transitions. [2023-02-17 22:21:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 22:21:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-02-17 22:21:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:21:56,212 INFO L225 Difference]: With dead ends: 251 [2023-02-17 22:21:56,212 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 22:21:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 22:21:56,226 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 22:21:56,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 22:21:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 22:21:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-17 22:21:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 108 states have internal predecessors, (115), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 22:21:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-17 22:21:56,298 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 37 [2023-02-17 22:21:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:21:56,299 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-17 22:21:56,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 22:21:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-17 22:21:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 22:21:56,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:21:56,303 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 22:21:56,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 22:21:56,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:21:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:21:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1675514385, now seen corresponding path program 1 times [2023-02-17 22:21:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:21:56,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505469757] [2023-02-17 22:21:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:21:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:21:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:21:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:21:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:21:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 22:21:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 22:21:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505469757] [2023-02-17 22:21:57,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505469757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:21:57,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068166147] [2023-02-17 22:21:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:21:57,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:21:57,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:21:57,021 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) [2023-02-17 22:21:57,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 22:21:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:57,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 22:21:57,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:21:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 22:21:57,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:21:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 22:21:57,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068166147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:21:57,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 22:21:57,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 12 [2023-02-17 22:21:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273126377] [2023-02-17 22:21:57,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 22:21:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 22:21:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 22:21:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 22:21:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-17 22:21:57,385 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 22:21:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:21:57,893 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2023-02-17 22:21:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 22:21:57,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2023-02-17 22:21:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:21:57,897 INFO L225 Difference]: With dead ends: 250 [2023-02-17 22:21:57,897 INFO L226 Difference]: Without dead ends: 133 [2023-02-17 22:21:57,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-17 22:21:57,900 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 22:21:57,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1037 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 22:21:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-17 22:21:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-17 22:21:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 116 states have internal predecessors, (124), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 22:21:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2023-02-17 22:21:57,930 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 38 [2023-02-17 22:21:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:21:57,931 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2023-02-17 22:21:57,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 22:21:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2023-02-17 22:21:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-17 22:21:57,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:21:57,939 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:21:57,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 22:21:58,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:21:58,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:21:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:21:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 800158065, now seen corresponding path program 1 times [2023-02-17 22:21:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:21:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587461810] [2023-02-17 22:21:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:21:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:21:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:21:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:21:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:21:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:21:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 22:22:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-17 22:22:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 22:22:00,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587461810] [2023-02-17 22:22:00,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587461810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:22:00,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521499206] [2023-02-17 22:22:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:00,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:22:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:22:00,837 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) [2023-02-17 22:22:00,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 22:22:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:01,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 22:22:01,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:22:01,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 22:22:01,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 100 [2023-02-17 22:22:01,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-17 22:22:01,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-02-17 22:22:01,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 22:22:01,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 27 [2023-02-17 22:22:01,243 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,276 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_dll_insert_master_#in~dll#1.base|))) (let ((.cse4 (select .cse2 |c_dll_insert_master_#in~dll#1.offset|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse0 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1)) (.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (and (= .cse0 v_DerPreprocessor_2) (not (= .cse1 0)) (not (= .cse1 |c_dll_insert_master_#in~dll#1.base|)) (= .cse0 v_DerPreprocessor_3) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse1 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse5 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6))) (and (= .cse5 v_DerPreprocessor_2) (not (= .cse6 0)) (not (= .cse6 |c_dll_insert_master_#in~dll#1.base|)) (= .cse5 (select |c_#memory_$Pointer$.base| .cse6)) (= .cse6 .cse4))))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse4)) (.cse8 (= |c_dll_insert_master_#in~dll#1.base| .cse4))) (and (= (select .cse7 |c_dll_insert_master_#in~dll#1.offset|) .cse4) (or (= .cse7 .cse2) (not .cse8)) .cse8 (not (= .cse4 0)))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10))) (and (= .cse9 v_DerPreprocessor_2) (not (= .cse10 0)) (not (= .cse10 |c_dll_insert_master_#in~dll#1.base|)) (= .cse9 v_DerPreprocessor_3) (= .cse9 (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12)) (.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (and (= .cse11 v_DerPreprocessor_2) (not (= .cse12 0)) (not (= .cse12 |c_dll_insert_master_#in~dll#1.base|)) (= .cse2 .cse13) (= .cse11 .cse13) (= .cse12 .cse4)))))))) is different from true [2023-02-17 22:22:01,353 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse2 (select .cse4 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse1 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3)) (.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (and (= .cse0 .cse1) (= v_DerPreprocessor_2 .cse1) (= v_DerPreprocessor_3 .cse1) (= .cse2 .cse3) (not (= .cse3 0)) (= .cse0 .cse4) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse3)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse6 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (= .cse5 .cse6) (= v_DerPreprocessor_2 .cse6) (= .cse2 .cse7) (not (= .cse7 0)) (= .cse5 .cse4) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse7)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8))) (and (= (select |c_#memory_$Pointer$.base| .cse8) .cse9) (= v_DerPreprocessor_2 .cse9) (= v_DerPreprocessor_3 .cse9) (= .cse2 .cse8) (not (= .cse8 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10))) (and (= (select |c_#memory_$Pointer$.base| .cse10) .cse11) (= v_DerPreprocessor_2 .cse11) (= .cse2 .cse10) (not (= .cse10 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse10)))))) (let ((.cse12 (= .cse2 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| .cse2))) (and .cse12 (not (= .cse2 0)) (= .cse2 (select .cse13 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (or (not .cse12) (= .cse4 .cse13))))))) is different from true [2023-02-17 22:22:01,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 22:22:01,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 374 treesize of output 463 [2023-02-17 22:22:01,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-17 22:22:01,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-17 22:22:01,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-17 22:22:01,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2023-02-17 22:22:01,710 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 285 [2023-02-17 22:22:01,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-17 22:22:01,853 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-17 22:22:01,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,868 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,874 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-17 22:22:01,885 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-17 22:22:01,896 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,901 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:01,907 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,009 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,015 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,018 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,023 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,032 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,037 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,042 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,048 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,054 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,060 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,064 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,069 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,075 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,084 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,088 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,094 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,103 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,108 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,114 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,118 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,124 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,137 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,156 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,160 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,164 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,170 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,174 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,182 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,188 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,192 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,205 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,211 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,216 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,221 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 186 [2023-02-17 22:22:02,246 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,251 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,261 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 186 [2023-02-17 22:22:02,275 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,282 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,288 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,307 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,312 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,316 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,336 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,347 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,351 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,355 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,366 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,374 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,384 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2023-02-17 22:22:02,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-17 22:22:02,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-02-17 22:22:02,425 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,430 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 115 [2023-02-17 22:22:02,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 147 [2023-02-17 22:22:02,458 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,461 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-02-17 22:22:02,470 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,477 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 22:22:02,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-02-17 22:22:02,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-17 22:22:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-02-17 22:22:02,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:22:02,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 22:22:02,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2023-02-17 22:22:02,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2023-02-17 22:22:02,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2023-02-17 22:22:02,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-17 22:22:02,584 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,585 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-17 22:22:02,593 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 22:22:02,597 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 22:22:02,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 215 [2023-02-17 22:22:02,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 242 [2023-02-17 22:22:02,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 238 [2023-02-17 22:22:02,631 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,633 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-17 22:22:02,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 22:22:02,639 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-17 22:22:02,646 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,650 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,651 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,652 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,654 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,655 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,657 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 22:22:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-17 22:22:02,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521499206] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:22:02,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 22:22:02,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 29 [2023-02-17 22:22:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564627910] [2023-02-17 22:22:02,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 22:22:02,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 22:22:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 22:22:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 22:22:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=645, Unknown=3, NotChecked=102, Total=812 [2023-02-17 22:22:02,700 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-17 22:22:03,202 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse3 (select .cse5 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse0 (not (= .cse3 0)))) (and .cse0 (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (and (= .cse1 .cse2) (= v_DerPreprocessor_2 .cse2) (= v_DerPreprocessor_3 .cse2) (= .cse3 .cse4) (not (= .cse4 0)) (= .cse1 .cse5) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse4)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8)) (.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (and (= .cse6 .cse7) (= v_DerPreprocessor_2 .cse7) (= .cse3 .cse8) (not (= .cse8 0)) (= .cse6 .cse5) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse9))) (and (= (select |c_#memory_$Pointer$.base| .cse9) .cse10) (= v_DerPreprocessor_2 .cse10) (= v_DerPreprocessor_3 .cse10) (= .cse3 .cse9) (not (= .cse9 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse9)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse12 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse11))) (and (= (select |c_#memory_$Pointer$.base| .cse11) .cse12) (= v_DerPreprocessor_2 .cse12) (= .cse3 .cse11) (not (= .cse11 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse11)))))) (let ((.cse13 (= .cse3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (.cse14 (select |c_#memory_$Pointer$.base| .cse3))) (and .cse13 .cse0 (= .cse3 (select .cse14 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (or (not .cse13) (= .cse5 .cse14))))) (= |c_##fun~$Pointer$~TO~VOID_#~10#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| |c_##fun~$Pointer$~TO~VOID_#~10#1.base|))))) is different from true [2023-02-17 22:22:03,208 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse3 (select .cse5 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse0 (not (= .cse3 0)))) (and .cse0 (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (and (= .cse1 .cse2) (= v_DerPreprocessor_2 .cse2) (= v_DerPreprocessor_3 .cse2) (= .cse3 .cse4) (not (= .cse4 0)) (= .cse1 .cse5) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse4)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8)) (.cse6 (select |c_#memory_$Pointer$.base| .cse8))) (and (= .cse6 .cse7) (= v_DerPreprocessor_2 .cse7) (= .cse3 .cse8) (not (= .cse8 0)) (= .cse6 .cse5) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse9))) (and (= (select |c_#memory_$Pointer$.base| .cse9) .cse10) (= v_DerPreprocessor_2 .cse10) (= v_DerPreprocessor_3 .cse10) (= .cse3 .cse9) (not (= .cse9 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse9)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse12 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse11))) (and (= (select |c_#memory_$Pointer$.base| .cse11) .cse12) (= v_DerPreprocessor_2 .cse12) (= .cse3 .cse11) (not (= .cse11 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse11)))))) (let ((.cse13 (= .cse3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (.cse14 (select |c_#memory_$Pointer$.base| .cse3))) (and .cse13 .cse0 (= .cse3 (select .cse14 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (or (not .cse13) (= .cse5 .cse14))))))))) is different from true [2023-02-17 22:22:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:22:04,244 INFO L93 Difference]: Finished difference Result 397 states and 503 transitions. [2023-02-17 22:22:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 22:22:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) Word has length 110 [2023-02-17 22:22:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:22:04,247 INFO L225 Difference]: With dead ends: 397 [2023-02-17 22:22:04,247 INFO L226 Difference]: Without dead ends: 268 [2023-02-17 22:22:04,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1898, Unknown=8, NotChecked=364, Total=2450 [2023-02-17 22:22:04,249 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 274 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 22:22:04,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1843 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1930 Invalid, 6 Unknown, 507 Unchecked, 1.1s Time] [2023-02-17 22:22:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-17 22:22:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 174. [2023-02-17 22:22:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 132 states have (on average 1.25) internal successors, (165), 150 states have internal predecessors, (165), 30 states have call successors, (30), 10 states have call predecessors, (30), 11 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-02-17 22:22:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2023-02-17 22:22:04,289 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 110 [2023-02-17 22:22:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:22:04,289 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2023-02-17 22:22:04,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-17 22:22:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2023-02-17 22:22:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 22:22:04,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:22:04,291 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:22:04,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 22:22:04,499 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,SelfDestructingSolverStorable2 [2023-02-17 22:22:04,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:22:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:22:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -692589117, now seen corresponding path program 1 times [2023-02-17 22:22:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:22:04,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852060126] [2023-02-17 22:22:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:22:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 22:22:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:06,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-02-17 22:22:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 22:22:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852060126] [2023-02-17 22:22:07,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852060126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:22:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920097837] [2023-02-17 22:22:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:22:07,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:22:07,073 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) [2023-02-17 22:22:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 22:22:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:07,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-17 22:22:07,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:22:07,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 22:22:07,495 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-02-17 22:22:09,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_2828 (Array Int Int))) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2828) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-17 22:22:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 22:22:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 4 not checked. [2023-02-17 22:22:09,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:22:09,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_206| Int) (v_ArrVal_2908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_206| v_ArrVal_2908) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_206| |c_#StackHeapBarrier|)))) is different from false [2023-02-17 22:22:09,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920097837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:22:09,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:22:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2023-02-17 22:22:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241953720] [2023-02-17 22:22:09,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:22:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 22:22:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 22:22:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 22:22:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=400, Unknown=11, NotChecked=82, Total=552 [2023-02-17 22:22:09,737 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand has 23 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 7 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 22:22:11,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 22:22:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:22:12,733 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2023-02-17 22:22:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 22:22:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 7 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 113 [2023-02-17 22:22:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:22:12,736 INFO L225 Difference]: With dead ends: 351 [2023-02-17 22:22:12,736 INFO L226 Difference]: Without dead ends: 182 [2023-02-17 22:22:12,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=165, Invalid=953, Unknown=12, NotChecked=130, Total=1260 [2023-02-17 22:22:12,738 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 147 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 44 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-17 22:22:12,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1225 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1087 Invalid, 39 Unknown, 159 Unchecked, 2.8s Time] [2023-02-17 22:22:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-17 22:22:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2023-02-17 22:22:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 154 states have internal predecessors, (168), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2023-02-17 22:22:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2023-02-17 22:22:12,755 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 113 [2023-02-17 22:22:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:22:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2023-02-17 22:22:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 7 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 22:22:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2023-02-17 22:22:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 22:22:12,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:22:12,763 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:22:12,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 22:22:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:22:12,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:22:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:22:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1829442305, now seen corresponding path program 1 times [2023-02-17 22:22:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:22:12,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873737075] [2023-02-17 22:22:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:22:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 22:22:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 22:22:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-02-17 22:22:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 22:22:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873737075] [2023-02-17 22:22:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873737075] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:22:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437842319] [2023-02-17 22:22:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:22:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:22:14,935 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) [2023-02-17 22:22:14,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 22:22:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-17 22:22:15,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:22:15,386 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 22:22:15,392 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 22:22:15,576 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 22 [2023-02-17 22:22:15,579 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 14 [2023-02-17 22:22:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-17 22:22:15,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:22:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437842319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 22:22:15,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:22:15,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2023-02-17 22:22:15,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513682518] [2023-02-17 22:22:15,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:22:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 22:22:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 22:22:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 22:22:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=218, Unknown=12, NotChecked=0, Total=272 [2023-02-17 22:22:15,701 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand has 16 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2023-02-17 22:22:17,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 22:22:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:22:18,403 INFO L93 Difference]: Finished difference Result 351 states and 433 transitions. [2023-02-17 22:22:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 22:22:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 113 [2023-02-17 22:22:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:22:18,405 INFO L225 Difference]: With dead ends: 351 [2023-02-17 22:22:18,405 INFO L226 Difference]: Without dead ends: 178 [2023-02-17 22:22:18,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=344, Unknown=12, NotChecked=0, Total=420 [2023-02-17 22:22:18,406 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 34 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-17 22:22:18,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 671 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 705 Invalid, 12 Unknown, 0 Unchecked, 2.6s Time] [2023-02-17 22:22:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-17 22:22:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-02-17 22:22:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 154 states have internal predecessors, (168), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-02-17 22:22:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2023-02-17 22:22:18,423 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 113 [2023-02-17 22:22:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:22:18,425 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2023-02-17 22:22:18,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2023-02-17 22:22:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2023-02-17 22:22:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 22:22:18,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:22:18,427 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:22:18,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 22:22:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 22:22:18,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:22:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:22:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash 522299907, now seen corresponding path program 1 times [2023-02-17 22:22:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:22:18,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107173772] [2023-02-17 22:22:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:22:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:22:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 22:22:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 22:22:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 22:22:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:22:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 22:22:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat