./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0219.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0219.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:00,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:00,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:00,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:00,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:00,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:00,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:00,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:00,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:00,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:00,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:00,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:00,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:00,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:00,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:00,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:00,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:00,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:00,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:00,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:00,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:00,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:00,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:00,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:00,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:00,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:00,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:00,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:00,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:00,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:00,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:00,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:00,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:00,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:00,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:00,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:00,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:00,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:00,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:00,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:00,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:00,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:45:00,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:00,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:00,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:00,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:00,164 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:00,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:00,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:00,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:00,165 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:00,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:00,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:00,166 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:00,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:00,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:00,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:00,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:00,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:00,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:00,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:00,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:00,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:00,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:00,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:00,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:00,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 [2022-02-20 23:45:00,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:00,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:00,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:00,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:00,389 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:00,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0219.i [2022-02-20 23:45:00,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686751d/4fa062ab1b724f17a63a577866feecfe/FLAG13d664da8 [2022-02-20 23:45:00,843 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:00,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0219.i [2022-02-20 23:45:00,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686751d/4fa062ab1b724f17a63a577866feecfe/FLAG13d664da8 [2022-02-20 23:45:01,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686751d/4fa062ab1b724f17a63a577866feecfe [2022-02-20 23:45:01,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:01,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:01,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:01,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:01,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:01,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148c197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01, skipping insertion in model container [2022-02-20 23:45:01,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:01,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:01,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:01,521 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:01,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:01,601 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:01,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01 WrapperNode [2022-02-20 23:45:01,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:01,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:01,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:01,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:01,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,648 INFO L137 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2022-02-20 23:45:01,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:01,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:01,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:01,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:01,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:01,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:01,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:01,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:01,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:01,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:45:01,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:45:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2022-02-20 23:45:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2022-02-20 23:45:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:01,913 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:01,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:02,331 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:02,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:02,337 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:45:02,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:02 BoogieIcfgContainer [2022-02-20 23:45:02,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:02,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:02,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:02,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:02,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:01" (1/3) ... [2022-02-20 23:45:02,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79be986e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:02, skipping insertion in model container [2022-02-20 23:45:02,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (2/3) ... [2022-02-20 23:45:02,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79be986e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:02, skipping insertion in model container [2022-02-20 23:45:02,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:02" (3/3) ... [2022-02-20 23:45:02,344 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0219.i [2022-02-20 23:45:02,348 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:02,348 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-02-20 23:45:02,377 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:02,388 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:45:02,388 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-02-20 23:45:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 105 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:02,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:02,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:02,421 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 928072, now seen corresponding path program 1 times [2022-02-20 23:45:02,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:02,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583570813] [2022-02-20 23:45:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:02,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {112#true} is VALID [2022-02-20 23:45:02,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {112#true} is VALID [2022-02-20 23:45:02,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume !true; {113#false} is VALID [2022-02-20 23:45:02,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#false} assume !(1 == #valid[~#list~0.base]); {113#false} is VALID [2022-02-20 23:45:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:02,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:02,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583570813] [2022-02-20 23:45:02,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583570813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:02,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:02,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:02,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902128174] [2022-02-20 23:45:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:45:02,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:02,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:02,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:02,613 INFO L87 Difference]: Start difference. First operand has 109 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 105 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,721 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-02-20 23:45:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:02,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:45:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2022-02-20 23:45:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2022-02-20 23:45:02,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2022-02-20 23:45:02,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,864 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:45:02,864 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:45:02,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:02,870 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:02,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:45:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-02-20 23:45:02,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:02,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:02,904 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:02,905 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,918 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-02-20 23:45:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 107 states. [2022-02-20 23:45:02,920 INFO L87 Difference]: Start difference. First operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 107 states. [2022-02-20 23:45:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,933 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-02-20 23:45:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:02,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:02,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-02-20 23:45:02,941 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 4 [2022-02-20 23:45:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:02,942 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-02-20 23:45:02,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:02,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:02,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:02,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:02,945 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 889700811, now seen corresponding path program 1 times [2022-02-20 23:45:02,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:02,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384484039] [2022-02-20 23:45:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:02,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:02,963 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:02,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211482803] [2022-02-20 23:45:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:02,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:02,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:02,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:45:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:03,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:03,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {546#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {546#true} is VALID [2022-02-20 23:45:03,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {546#true} is VALID [2022-02-20 23:45:03,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {546#true} is VALID [2022-02-20 23:45:03,122 INFO L272 TraceCheckUtils]: 3: Hoare triple {546#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {546#true} is VALID [2022-02-20 23:45:03,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {546#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {563#(= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:03,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#(= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {547#false} is VALID [2022-02-20 23:45:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:03,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:03,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:03,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384484039] [2022-02-20 23:45:03,125 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:03,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211482803] [2022-02-20 23:45:03,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211482803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:03,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:03,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:03,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772509456] [2022-02-20 23:45:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:03,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:03,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:03,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:03,136 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,276 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:03,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:03,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:45:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:45:03,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 23:45:03,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,367 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:45:03,368 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 23:45:03,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:03,369 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:03,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 163 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 23:45:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 23:45:03,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:03,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:03,373 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:03,373 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,376 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:03,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 23:45:03,377 INFO L87 Difference]: Start difference. First operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 23:45:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,380 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:03,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:03,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-02-20 23:45:03,384 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 6 [2022-02-20 23:45:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:03,384 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-02-20 23:45:03,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:03,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:03,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:03,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:03,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:03,602 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1810921558, now seen corresponding path program 1 times [2022-02-20 23:45:03,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:03,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889512092] [2022-02-20 23:45:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:03,616 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:03,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361262663] [2022-02-20 23:45:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:03,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:03,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:03,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:03,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:45:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:03,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:04,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {990#true} is VALID [2022-02-20 23:45:04,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {990#true} is VALID [2022-02-20 23:45:04,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {990#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {990#true} is VALID [2022-02-20 23:45:04,473 INFO L272 TraceCheckUtils]: 3: Hoare triple {990#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {990#true} is VALID [2022-02-20 23:45:04,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {990#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} is VALID [2022-02-20 23:45:04,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} is VALID [2022-02-20 23:45:04,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {991#false} is VALID [2022-02-20 23:45:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:04,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:04,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889512092] [2022-02-20 23:45:04,482 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:04,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361262663] [2022-02-20 23:45:04,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361262663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:04,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129944071] [2022-02-20 23:45:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:04,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:04,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:04,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:04,495 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,608 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:45:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:45:04,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 23:45:04,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,708 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:45:04,708 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:45:04,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:04,709 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:04,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-02-20 23:45:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:45:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-20 23:45:04,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:04,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,713 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,713 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,716 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:04,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:45:04,717 INFO L87 Difference]: Start difference. First operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:45:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,720 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:04,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:04,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-02-20 23:45:04,723 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 7 [2022-02-20 23:45:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:04,724 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-02-20 23:45:04,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:04,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:04,725 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:04,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:04,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 23:45:04,939 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -713444144, now seen corresponding path program 1 times [2022-02-20 23:45:04,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:04,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946305057] [2022-02-20 23:45:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:04,953 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:04,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521549755] [2022-02-20 23:45:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:04,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:04,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:04,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:45:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:45:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:05,170 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:45:05,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:45:05,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {1433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {1433#true} is VALID [2022-02-20 23:45:05,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1433#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {1433#true} is VALID [2022-02-20 23:45:05,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1433#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {1433#true} is VALID [2022-02-20 23:45:05,183 INFO L272 TraceCheckUtils]: 3: Hoare triple {1433#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {1433#true} is VALID [2022-02-20 23:45:05,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {1433#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1433#true} is VALID [2022-02-20 23:45:05,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {1433#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1433#true} is VALID [2022-02-20 23:45:05,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1433#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {1433#true} is VALID [2022-02-20 23:45:05,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1433#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1433#true} is VALID [2022-02-20 23:45:05,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {1433#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {1433#true} is VALID [2022-02-20 23:45:05,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-02-20 23:45:05,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1433#true} {1433#true} #174#return; {1433#true} is VALID [2022-02-20 23:45:05,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {1433#true} is VALID [2022-02-20 23:45:05,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1433#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {1433#true} is VALID [2022-02-20 23:45:05,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {1433#true} is VALID [2022-02-20 23:45:05,185 INFO L272 TraceCheckUtils]: 14: Hoare triple {1433#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {1433#true} is VALID [2022-02-20 23:45:05,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1483#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:05,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {1483#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:05,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:05,189 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {1433#true} #176#return; {1504#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:45:05,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:05,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l2_insert_~item~0#1.base]); {1434#false} is VALID [2022-02-20 23:45:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:45:05,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:05,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:05,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946305057] [2022-02-20 23:45:05,191 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:05,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521549755] [2022-02-20 23:45:05,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521549755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:05,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:05,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:05,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315277760] [2022-02-20 23:45:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:05,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:05,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:05,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:05,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:05,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:05,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:05,210 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,706 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 23:45:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 23:45:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 23:45:05,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 141 transitions. [2022-02-20 23:45:05,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:05,816 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:45:05,816 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:45:05,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:05,817 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:05,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 344 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:45:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2022-02-20 23:45:05,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:05,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,821 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,821 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,832 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 23:45:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-02-20 23:45:05,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 132 states. [2022-02-20 23:45:05,833 INFO L87 Difference]: Start difference. First operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 132 states. [2022-02-20 23:45:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,837 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 23:45:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-02-20 23:45:05,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:05,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-02-20 23:45:05,839 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 26 [2022-02-20 23:45:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:05,840 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-02-20 23:45:05,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 23:45:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:05,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:05,840 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:06,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:06,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -713444143, now seen corresponding path program 1 times [2022-02-20 23:45:06,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:06,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466685453] [2022-02-20 23:45:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:06,059 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:06,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800788884] [2022-02-20 23:45:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:06,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:06,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:45:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 23:45:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:12,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 23:45:12,473 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:12,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:13,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {2020#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2020#true} is VALID [2022-02-20 23:45:13,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L272 TraceCheckUtils]: 3: Hoare triple {2020#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {2020#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {2020#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2020#true} is VALID [2022-02-20 23:45:13,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-02-20 23:45:13,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2020#true} {2020#true} #174#return; {2020#true} is VALID [2022-02-20 23:45:13,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {2020#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {2020#true} is VALID [2022-02-20 23:45:13,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {2020#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {2020#true} is VALID [2022-02-20 23:45:13,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2020#true} is VALID [2022-02-20 23:45:13,133 INFO L272 TraceCheckUtils]: 14: Hoare triple {2020#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {2020#true} is VALID [2022-02-20 23:45:13,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {2020#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2070#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:15,143 WARN L290 TraceCheckUtils]: 16: Hoare triple {2070#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2074#(and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} is UNKNOWN [2022-02-20 23:45:15,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {2074#(and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2078#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_#Ultimate.C_memset_#t~loopctr22#1| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (select |#length| |calloc_model_~ptr~0#1.base|)))} is VALID [2022-02-20 23:45:15,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {2078#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_#Ultimate.C_memset_#t~loopctr22#1| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (select |#length| |calloc_model_~ptr~0#1.base|)))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2082#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_~ptr~0#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int) (|aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| Int)) (and (<= (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296) (select |#length| |calloc_model_~ptr~0#1.base|)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296)) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:45:17,174 WARN L290 TraceCheckUtils]: 19: Hoare triple {2082#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_~ptr~0#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int) (|aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| Int)) (and (<= (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296) (select |#length| |calloc_model_~ptr~0#1.base|)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296)) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2086#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is UNKNOWN [2022-02-20 23:45:17,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2086#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} assume true; {2086#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:17,177 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2086#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} {2020#true} #176#return; {2093#(and (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 4294967296)) (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:45:17,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {2093#(and (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 4294967296)) (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|))))} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {2097#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {2097#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {2097#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {2097#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {2104#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {2104#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {2021#false} is VALID [2022-02-20 23:45:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:45:17,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:17,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466685453] [2022-02-20 23:45:17,182 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:17,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800788884] [2022-02-20 23:45:17,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800788884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:17,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067450025] [2022-02-20 23:45:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:17,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:20,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:20,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:20,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:20,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:20,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-02-20 23:45:20,086 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,382 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:45:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:45:20,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2022-02-20 23:45:24,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 116 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,544 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:45:24,544 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:45:24,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-02-20 23:45:24,545 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 384 Unchecked, 0.0s Time] [2022-02-20 23:45:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:45:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-20 23:45:24,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:24,549 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:24,549 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,551 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:24,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:45:24,552 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:45:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,554 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:24,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-02-20 23:45:24,557 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 26 [2022-02-20 23:45:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,558 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-02-20 23:45:24,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:24,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,558 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 23:45:24,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:24,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1369822126, now seen corresponding path program 1 times [2022-02-20 23:45:24,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038796646] [2022-02-20 23:45:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,772 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:24,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702867841] [2022-02-20 23:45:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:24,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:24,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:45:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 23:45:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:24,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 23:45:47,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:47,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-20 23:45:47,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:47,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:47,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {2547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2547#true} is VALID [2022-02-20 23:45:47,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2547#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {2547#true} is VALID [2022-02-20 23:45:47,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {2547#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2547#true} is VALID [2022-02-20 23:45:47,518 INFO L272 TraceCheckUtils]: 3: Hoare triple {2547#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {2547#true} is VALID [2022-02-20 23:45:47,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {2547#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2547#true} is VALID [2022-02-20 23:45:47,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {2547#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {2547#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {2547#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {2547#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {2547#true} assume true; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2547#true} {2547#true} #174#return; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {2547#true} is VALID [2022-02-20 23:45:47,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {2547#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2547#true} is VALID [2022-02-20 23:45:47,520 INFO L272 TraceCheckUtils]: 14: Hoare triple {2547#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {2547#true} is VALID [2022-02-20 23:45:47,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {2547#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2597#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {2597#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr22#1 := 1 + #Ultimate.C_memset_#t~loopctr22#1; {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2614#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:47,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {2614#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} assume true; {2614#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:47,528 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2614#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} {2547#true} #176#return; {2621#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (= (mod (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1))} is VALID [2022-02-20 23:45:47,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {2621#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (= (mod (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1))} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {2625#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {2625#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {2632#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:47,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {2632#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {2548#false} is VALID [2022-02-20 23:45:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:45:47,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:47,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:47,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038796646] [2022-02-20 23:45:47,534 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:47,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702867841] [2022-02-20 23:45:47,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702867841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:47,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:47,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:47,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605712303] [2022-02-20 23:45:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 23:45:47,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:47,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:47,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:47,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:47,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:47,567 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,041 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:48,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 23:45:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:45:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:45:48,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-02-20 23:45:48,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:48,130 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:45:48,130 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:45:48,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:48,131 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:48,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 327 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2022-02-20 23:45:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:45:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2022-02-20 23:45:48,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:48,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,139 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,139 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,141 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:48,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 109 states. [2022-02-20 23:45:48,142 INFO L87 Difference]: Start difference. First operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 109 states. [2022-02-20 23:45:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,144 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:48,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:48,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-02-20 23:45:48,146 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 27 [2022-02-20 23:45:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:48,147 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-02-20 23:45:48,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:48,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:48,148 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:48,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:45:48,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:48,359 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1574944978, now seen corresponding path program 1 times [2022-02-20 23:45:48,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:48,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616255569] [2022-02-20 23:45:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:48,381 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:48,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949300357] [2022-02-20 23:45:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:48,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:48,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:48,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:48,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:45:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:48,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:45:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:48,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {3068#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3068#true} is VALID [2022-02-20 23:45:48,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,520 INFO L272 TraceCheckUtils]: 3: Hoare triple {3068#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3068#true} is VALID [2022-02-20 23:45:48,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {3068#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3068#true} is VALID [2022-02-20 23:45:48,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {3068#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3068#true} is VALID [2022-02-20 23:45:48,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {3068#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3068#true} is VALID [2022-02-20 23:45:48,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {3068#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3068#true} is VALID [2022-02-20 23:45:48,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {3068#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-02-20 23:45:48,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3068#true} {3068#true} #174#return; {3068#true} is VALID [2022-02-20 23:45:48,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {3068#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {3068#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3068#true} is VALID [2022-02-20 23:45:48,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {3068#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,524 INFO L272 TraceCheckUtils]: 14: Hoare triple {3068#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3068#true} is VALID [2022-02-20 23:45:48,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {3068#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3068#true} is VALID [2022-02-20 23:45:48,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {3068#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3068#true} is VALID [2022-02-20 23:45:48,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3068#true} is VALID [2022-02-20 23:45:48,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {3068#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3068#true} is VALID [2022-02-20 23:45:48,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {3068#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {3068#true} assume true; {3068#true} is VALID [2022-02-20 23:45:48,545 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3068#true} {3068#true} #176#return; {3068#true} is VALID [2022-02-20 23:45:48,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {3068#true} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3068#true} is VALID [2022-02-20 23:45:48,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#true} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3068#true} is VALID [2022-02-20 23:45:48,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#true} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3068#true} is VALID [2022-02-20 23:45:48,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {3068#true} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3148#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:45:48,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {3148#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3148#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:45:48,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {3148#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {3069#false} is VALID [2022-02-20 23:45:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:45:48,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:48,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:48,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616255569] [2022-02-20 23:45:48,551 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:48,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949300357] [2022-02-20 23:45:48,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949300357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:48,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:48,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:48,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474579440] [2022-02-20 23:45:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 23:45:48,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:48,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:48,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:48,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:48,574 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,710 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:48,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 23:45:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:45:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:45:48,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 23:45:48,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:48,811 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:45:48,811 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:45:48,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:48,812 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:48,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:45:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-02-20 23:45:48,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:48,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,817 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,817 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,830 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:45:48,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-02-20 23:45:48,831 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-02-20 23:45:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,834 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:45:48,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:48,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:48,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:48,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-02-20 23:45:48,837 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 28 [2022-02-20 23:45:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:48,837 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-02-20 23:45:48,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-02-20 23:45:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:48,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:48,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:48,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:49,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:49,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1693634963, now seen corresponding path program 1 times [2022-02-20 23:45:49,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:49,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612285533] [2022-02-20 23:45:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:49,059 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:49,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091198503] [2022-02-20 23:45:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:49,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:49,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:45:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:45:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:49,387 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:49,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:49,420 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:49,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:49,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {3563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3563#true} is VALID [2022-02-20 23:45:49,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3563#true} is VALID [2022-02-20 23:45:49,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3563#true} is VALID [2022-02-20 23:45:49,443 INFO L272 TraceCheckUtils]: 3: Hoare triple {3563#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3563#true} is VALID [2022-02-20 23:45:49,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {3563#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3580#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:49,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:49,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:49,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {3563#true} #174#return; {3601#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} is VALID [2022-02-20 23:45:49,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:49,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:49,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,448 INFO L272 TraceCheckUtils]: 14: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3616#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:49,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {3616#(= |old(#valid)| |#valid|)} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3620#(exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))} is VALID [2022-02-20 23:45:49,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {3620#(exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:49,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:49,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:49,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:49,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume true; {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:49,453 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3624#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} #176#return; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset := read~$Pointer$(l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L659 {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_#t~mem7#1.base == 0 && l2_insert_#t~mem7#1.offset == 0);havoc l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(1 == #valid[l2_insert_~list#1.base]); {3564#false} is VALID [2022-02-20 23:45:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:49,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:49,812 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:49,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:45:49,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(1 == #valid[l2_insert_~list#1.base]); {3564#false} is VALID [2022-02-20 23:45:49,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_#t~mem7#1.base == 0 && l2_insert_#t~mem7#1.offset == 0);havoc l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset := read~$Pointer$(l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L659 {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,843 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} #176#return; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume true; {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {3707#(or (forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3707#(or (forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:49,846 INFO L272 TraceCheckUtils]: 14: Hoare triple {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3691#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:49,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3612#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:49,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:49,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3605#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:49,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {3563#true} #174#return; {3601#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} is VALID [2022-02-20 23:45:49,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:49,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3594#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:49,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3584#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:49,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {3563#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3580#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:49,852 INFO L272 TraceCheckUtils]: 3: Hoare triple {3563#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3563#true} is VALID [2022-02-20 23:45:49,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3563#true} is VALID [2022-02-20 23:45:49,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3563#true} is VALID [2022-02-20 23:45:49,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {3563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3563#true} is VALID [2022-02-20 23:45:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:49,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:49,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612285533] [2022-02-20 23:45:49,854 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:49,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091198503] [2022-02-20 23:45:49,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091198503] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:49,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:49,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2022-02-20 23:45:49,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84414554] [2022-02-20 23:45:49,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:49,854 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 23:45:49,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:49,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:49,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:45:49,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:45:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:49,886 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,655 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-02-20 23:45:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 23:45:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-02-20 23:45:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-02-20 23:45:50,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 148 transitions. [2022-02-20 23:45:50,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:50,767 INFO L225 Difference]: With dead ends: 139 [2022-02-20 23:45:50,768 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 23:45:50,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:45:50,768 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 91 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:50,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 537 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 338 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2022-02-20 23:45:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 23:45:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2022-02-20 23:45:50,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:50,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:50,771 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:50,772 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,774 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-02-20 23:45:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2022-02-20 23:45:50,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-02-20 23:45:50,775 INFO L87 Difference]: Start difference. First operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-02-20 23:45:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,777 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-02-20 23:45:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2022-02-20 23:45:50,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:50,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-02-20 23:45:50,780 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 30 [2022-02-20 23:45:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:50,780 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-02-20 23:45:50,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:50,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:50,781 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:50,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:50,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:50,998 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1693634964, now seen corresponding path program 1 times [2022-02-20 23:45:50,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:50,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604089907] [2022-02-20 23:45:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:51,013 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:51,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841230711] [2022-02-20 23:45:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:51,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:51,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:45:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:51,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:45:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:51,177 INFO L286 TraceCheckSpWp]: Computing forward predicates...