./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-token-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:40:58,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:40:58,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:40:58,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:40:58,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:40:58,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:40:58,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:40:58,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:40:58,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:40:58,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:40:58,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:40:58,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:40:58,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:40:58,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:40:58,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:40:58,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:40:58,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:40:58,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:40:58,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:40:58,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:40:58,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:40:59,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:40:59,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:40:59,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:40:59,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:40:59,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:40:59,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:40:59,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:40:59,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:40:59,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:40:59,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:40:59,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:40:59,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:40:59,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:40:59,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:40:59,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:40:59,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:40:59,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:40:59,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:40:59,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:40:59,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:40:59,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-28 05:40:59,028 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:40:59,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:40:59,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:40:59,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:40:59,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:40:59,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:40:59,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:40:59,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:40:59,030 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:40:59,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:40:59,031 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:40:59,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:40:59,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:40:59,032 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:40:59,032 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:40:59,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:40:59,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:40:59,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:40:59,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:40:59,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:40:59,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:40:59,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:40:59,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:40:59,034 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-memcleanup) ) 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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2021-12-28 05:40:59,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:40:59,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:40:59,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:40:59,402 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:40:59,403 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:40:59,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-2.i [2021-12-28 05:40:59,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018b33b56/52a975d2e3294517bfbd266d2a6b256f/FLAGe102f0269 [2021-12-28 05:40:59,900 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:40:59,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i [2021-12-28 05:40:59,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018b33b56/52a975d2e3294517bfbd266d2a6b256f/FLAGe102f0269 [2021-12-28 05:40:59,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018b33b56/52a975d2e3294517bfbd266d2a6b256f [2021-12-28 05:40:59,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:40:59,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:40:59,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:40:59,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:40:59,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:40:59,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:40:59,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114eaec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59, skipping insertion in model container [2021-12-28 05:40:59,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:40:59,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:40:59,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:00,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-12-28 05:41:00,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-12-28 05:41:00,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-12-28 05:41:00,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-12-28 05:41:00,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-12-28 05:41:00,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-12-28 05:41:00,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:00,332 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:00,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-12-28 05:41:00,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-12-28 05:41:00,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-12-28 05:41:00,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-12-28 05:41:00,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-12-28 05:41:00,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-12-28 05:41:00,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:00,459 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:00,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00 WrapperNode [2021-12-28 05:41:00,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:00,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:00,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:00,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:00,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,569 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2021-12-28 05:41:00,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:00,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:00,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:00,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:00,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:00,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:00,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:00,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:00,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (1/1) ... [2021-12-28 05:41:00,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:00,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:00,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:41:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:00,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:00,855 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:00,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:01,104 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:01,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:01,109 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-28 05:41:01,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:01 BoogieIcfgContainer [2021-12-28 05:41:01,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:01,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:01,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:01,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:01,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:40:59" (1/3) ... [2021-12-28 05:41:01,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a12bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:01, skipping insertion in model container [2021-12-28 05:41:01,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:00" (2/3) ... [2021-12-28 05:41:01,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a12bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:01, skipping insertion in model container [2021-12-28 05:41:01,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:01" (3/3) ... [2021-12-28 05:41:01,117 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2021-12-28 05:41:01,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:01,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-12-28 05:41:01,150 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:01,155 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 [2021-12-28 05:41:01,155 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-12-28 05:41:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 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) [2021-12-28 05:41:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:01,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:01,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:41:01,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660859719] [2021-12-28 05:41:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:01,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660859719] [2021-12-28 05:41:01,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660859719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:01,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159910175] [2021-12-28 05:41:01,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:01,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,333 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-28 05:41:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,506 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2021-12-28 05:41:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:01,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-28 05:41:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,513 INFO L225 Difference]: With dead ends: 153 [2021-12-28 05:41:01,514 INFO L226 Difference]: Without dead ends: 151 [2021-12-28 05:41:01,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,518 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-28 05:41:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2021-12-28 05:41:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 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) [2021-12-28 05:41:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2021-12-28 05:41:01,571 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2021-12-28 05:41:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,571 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2021-12-28 05:41:01,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-28 05:41:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2021-12-28 05:41:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:01,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:01,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:41:01,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:41:01,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677571918] [2021-12-28 05:41:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:01,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677571918] [2021-12-28 05:41:01,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677571918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:01,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616746226] [2021-12-28 05:41:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:01,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,659 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-28 05:41:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,758 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2021-12-28 05:41:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-28 05:41:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,762 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:41:01,762 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:41:01,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,764 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:41:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2021-12-28 05:41:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 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) [2021-12-28 05:41:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2021-12-28 05:41:01,779 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2021-12-28 05:41:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,780 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2021-12-28 05:41:01,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-28 05:41:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2021-12-28 05:41:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:41:01,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:01,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:41:01,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2021-12-28 05:41:01,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057008619] [2021-12-28 05:41:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:01,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057008619] [2021-12-28 05:41:01,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057008619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:01,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124809161] [2021-12-28 05:41:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:01,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:01,874 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-28 05:41:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,073 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2021-12-28 05:41:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:41:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-28 05:41:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,075 INFO L225 Difference]: With dead ends: 241 [2021-12-28 05:41:02,075 INFO L226 Difference]: Without dead ends: 241 [2021-12-28 05:41:02,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,076 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 271 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 113 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-28 05:41:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2021-12-28 05:41:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 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) [2021-12-28 05:41:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2021-12-28 05:41:02,085 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2021-12-28 05:41:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,085 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2021-12-28 05:41:02,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-28 05:41:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2021-12-28 05:41:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:41:02,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:41:02,087 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:02,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2021-12-28 05:41:02,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966265464] [2021-12-28 05:41:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:02,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966265464] [2021-12-28 05:41:02,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966265464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:02,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848615112] [2021-12-28 05:41:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:02,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:02,131 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-28 05:41:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,223 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-12-28 05:41:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-28 05:41:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,224 INFO L225 Difference]: With dead ends: 157 [2021-12-28 05:41:02,224 INFO L226 Difference]: Without dead ends: 157 [2021-12-28 05:41:02,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,225 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 181 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 74 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-28 05:41:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2021-12-28 05:41:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 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) [2021-12-28 05:41:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2021-12-28 05:41:02,230 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2021-12-28 05:41:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,231 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2021-12-28 05:41:02,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-28 05:41:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2021-12-28 05:41:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:02,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:41:02,232 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-28 05:41:02,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418918767] [2021-12-28 05:41:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:02,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418918767] [2021-12-28 05:41:02,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418918767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:02,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520352593] [2021-12-28 05:41:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:02,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,315 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-12-28 05:41:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,460 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2021-12-28 05:41:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2021-12-28 05:41:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,462 INFO L225 Difference]: With dead ends: 151 [2021-12-28 05:41:02,462 INFO L226 Difference]: Without dead ends: 151 [2021-12-28 05:41:02,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:02,463 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-28 05:41:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-28 05:41:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 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) [2021-12-28 05:41:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-12-28 05:41:02,469 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2021-12-28 05:41:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,469 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-12-28 05:41:02,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-12-28 05:41:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-12-28 05:41:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:02,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:41:02,471 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-28 05:41:02,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949687528] [2021-12-28 05:41:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:02,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949687528] [2021-12-28 05:41:02,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949687528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:02,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587401457] [2021-12-28 05:41:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:02,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,521 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-12-28 05:41:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,639 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2021-12-28 05:41:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2021-12-28 05:41:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,640 INFO L225 Difference]: With dead ends: 150 [2021-12-28 05:41:02,641 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 05:41:02,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:02,642 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 283 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 05:41:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-28 05:41:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 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) [2021-12-28 05:41:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2021-12-28 05:41:02,647 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2021-12-28 05:41:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,647 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2021-12-28 05:41:02,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-12-28 05:41:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2021-12-28 05:41:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:02,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:41:02,649 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2021-12-28 05:41:02,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107523398] [2021-12-28 05:41:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:02,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107523398] [2021-12-28 05:41:02,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107523398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:02,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698733102] [2021-12-28 05:41:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:02,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:02,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,734 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-12-28 05:41:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,873 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2021-12-28 05:41:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2021-12-28 05:41:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,874 INFO L225 Difference]: With dead ends: 149 [2021-12-28 05:41:02,875 INFO L226 Difference]: Without dead ends: 149 [2021-12-28 05:41:02,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:02,876 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-28 05:41:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-28 05:41:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 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) [2021-12-28 05:41:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2021-12-28 05:41:02,881 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2021-12-28 05:41:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,881 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2021-12-28 05:41:02,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-12-28 05:41:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2021-12-28 05:41:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:02,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:41:02,883 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2021-12-28 05:41:02,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46845212] [2021-12-28 05:41:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:02,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46845212] [2021-12-28 05:41:02,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46845212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:02,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246753790] [2021-12-28 05:41:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:02,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,946 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-12-28 05:41:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:03,071 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2021-12-28 05:41:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2021-12-28 05:41:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:03,073 INFO L225 Difference]: With dead ends: 148 [2021-12-28 05:41:03,073 INFO L226 Difference]: Without dead ends: 148 [2021-12-28 05:41:03,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:03,074 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:03,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-28 05:41:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-28 05:41:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 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) [2021-12-28 05:41:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2021-12-28 05:41:03,078 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2021-12-28 05:41:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:03,078 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2021-12-28 05:41:03,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-12-28 05:41:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2021-12-28 05:41:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:41:03,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:03,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:03,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:41:03,080 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:03,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-28 05:41:03,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:03,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193995011] [2021-12-28 05:41:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:03,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:03,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193995011] [2021-12-28 05:41:03,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193995011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:03,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:03,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:41:03,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804944104] [2021-12-28 05:41:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:03,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:41:03,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:41:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:03,190 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2021-12-28 05:41:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:03,414 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2021-12-28 05:41:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:41:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2021-12-28 05:41:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:03,415 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:41:03,415 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:41:03,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:41:03,416 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 184 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:03,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 188 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:41:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2021-12-28 05:41:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 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) [2021-12-28 05:41:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2021-12-28 05:41:03,419 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2021-12-28 05:41:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:03,420 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2021-12-28 05:41:03,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2021-12-28 05:41:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2021-12-28 05:41:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:41:03,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:03,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:03,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:41:03,421 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-28 05:41:03,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:03,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92821554] [2021-12-28 05:41:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:03,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:03,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:03,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92821554] [2021-12-28 05:41:03,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92821554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:03,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:03,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:41:03,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203318218] [2021-12-28 05:41:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:03,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:41:03,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:41:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:03,620 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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) [2021-12-28 05:41:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:04,039 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2021-12-28 05:41:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:41:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2021-12-28 05:41:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:04,041 INFO L225 Difference]: With dead ends: 149 [2021-12-28 05:41:04,041 INFO L226 Difference]: Without dead ends: 149 [2021-12-28 05:41:04,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:41:04,042 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:04,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 282 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-28 05:41:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2021-12-28 05:41:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 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) [2021-12-28 05:41:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-12-28 05:41:04,047 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2021-12-28 05:41:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:04,047 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-12-28 05:41:04,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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) [2021-12-28 05:41:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-12-28 05:41:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:41:04,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:04,048 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:04,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:41:04,049 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2021-12-28 05:41:04,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:04,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344823854] [2021-12-28 05:41:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:04,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:04,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:04,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344823854] [2021-12-28 05:41:04,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344823854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:04,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:04,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:41:04,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241981551] [2021-12-28 05:41:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:04,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:41:04,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:41:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:04,124 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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) [2021-12-28 05:41:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:04,302 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2021-12-28 05:41:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:41:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2021-12-28 05:41:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:04,303 INFO L225 Difference]: With dead ends: 126 [2021-12-28 05:41:04,303 INFO L226 Difference]: Without dead ends: 126 [2021-12-28 05:41:04,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:41:04,307 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 63 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:04,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 253 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-28 05:41:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2021-12-28 05:41:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 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) [2021-12-28 05:41:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2021-12-28 05:41:04,312 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2021-12-28 05:41:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:04,312 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-12-28 05:41:04,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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) [2021-12-28 05:41:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2021-12-28 05:41:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:41:04,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:04,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:04,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:41:04,314 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2021-12-28 05:41:04,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425391791] [2021-12-28 05:41:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:04,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:04,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425391791] [2021-12-28 05:41:04,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425391791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:04,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:04,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:41:04,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588506607] [2021-12-28 05:41:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:04,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:41:04,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:41:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:04,452 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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) [2021-12-28 05:41:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:04,633 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2021-12-28 05:41:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:41:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2021-12-28 05:41:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:04,635 INFO L225 Difference]: With dead ends: 125 [2021-12-28 05:41:04,635 INFO L226 Difference]: Without dead ends: 125 [2021-12-28 05:41:04,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:41:04,636 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:04,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 263 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-28 05:41:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2021-12-28 05:41:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 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) [2021-12-28 05:41:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2021-12-28 05:41:04,642 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2021-12-28 05:41:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:04,642 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2021-12-28 05:41:04,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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) [2021-12-28 05:41:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2021-12-28 05:41:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:41:04,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:04,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:04,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:41:04,644 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2021-12-28 05:41:04,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:04,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432362988] [2021-12-28 05:41:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:04,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:04,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432362988] [2021-12-28 05:41:04,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432362988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:04,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:04,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:04,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275993196] [2021-12-28 05:41:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:04,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:04,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:04,713 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-12-28 05:41:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:04,791 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2021-12-28 05:41:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:04,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2021-12-28 05:41:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:04,792 INFO L225 Difference]: With dead ends: 123 [2021-12-28 05:41:04,793 INFO L226 Difference]: Without dead ends: 123 [2021-12-28 05:41:04,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:04,794 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 153 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:04,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 113 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-28 05:41:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2021-12-28 05:41:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 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) [2021-12-28 05:41:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-12-28 05:41:04,797 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2021-12-28 05:41:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:04,798 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-12-28 05:41:04,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-12-28 05:41:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-12-28 05:41:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:41:04,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:04,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:04,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:41:04,802 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2021-12-28 05:41:04,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:04,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694139401] [2021-12-28 05:41:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:04,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:04,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:04,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694139401] [2021-12-28 05:41:04,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694139401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:04,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:04,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:04,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876929316] [2021-12-28 05:41:04,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:04,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:04,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:04,858 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-12-28 05:41:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:04,926 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2021-12-28 05:41:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:04,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2021-12-28 05:41:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:04,928 INFO L225 Difference]: With dead ends: 181 [2021-12-28 05:41:04,928 INFO L226 Difference]: Without dead ends: 181 [2021-12-28 05:41:04,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:04,929 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:04,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-28 05:41:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2021-12-28 05:41:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 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) [2021-12-28 05:41:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2021-12-28 05:41:04,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2021-12-28 05:41:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:04,933 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2021-12-28 05:41:04,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-12-28 05:41:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2021-12-28 05:41:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:41:04,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:04,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:04,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:41:04,935 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2021-12-28 05:41:04,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:04,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25297279] [2021-12-28 05:41:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:04,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:05,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:05,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25297279] [2021-12-28 05:41:05,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25297279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:05,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:05,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:41:05,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609711453] [2021-12-28 05:41:05,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:05,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:41:05,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:41:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:05,153 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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) [2021-12-28 05:41:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:05,462 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2021-12-28 05:41:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:41:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 25 [2021-12-28 05:41:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:05,463 INFO L225 Difference]: With dead ends: 225 [2021-12-28 05:41:05,463 INFO L226 Difference]: Without dead ends: 225 [2021-12-28 05:41:05,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:41:05,464 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 426 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:05,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 313 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-28 05:41:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2021-12-28 05:41:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 132 states have internal predecessors, (144), 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) [2021-12-28 05:41:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-12-28 05:41:05,468 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2021-12-28 05:41:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:05,468 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-12-28 05:41:05,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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) [2021-12-28 05:41:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-12-28 05:41:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:41:05,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:05,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:05,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:41:05,470 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2021-12-28 05:41:05,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:05,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71345298] [2021-12-28 05:41:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:05,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:05,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:05,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71345298] [2021-12-28 05:41:05,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71345298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:05,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:05,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:05,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474135739] [2021-12-28 05:41:05,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:05,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:05,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:05,507 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-12-28 05:41:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:05,576 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2021-12-28 05:41:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-12-28 05:41:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:05,577 INFO L225 Difference]: With dead ends: 131 [2021-12-28 05:41:05,577 INFO L226 Difference]: Without dead ends: 131 [2021-12-28 05:41:05,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:05,578 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:05,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 236 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-28 05:41:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-28 05:41:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 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) [2021-12-28 05:41:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2021-12-28 05:41:05,581 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2021-12-28 05:41:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:05,582 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2021-12-28 05:41:05,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-12-28 05:41:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2021-12-28 05:41:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:41:05,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:05,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:05,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:41:05,588 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2021-12-28 05:41:05,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:05,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137473045] [2021-12-28 05:41:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:05,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:05,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:05,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137473045] [2021-12-28 05:41:05,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137473045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:05,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:05,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:41:05,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565347359] [2021-12-28 05:41:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:05,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:41:05,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:41:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:05,795 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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) [2021-12-28 05:41:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:06,294 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2021-12-28 05:41:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:41:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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 28 [2021-12-28 05:41:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:06,295 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:41:06,295 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:41:06,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:41:06,296 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:06,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 340 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:41:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:41:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2021-12-28 05:41:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 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) [2021-12-28 05:41:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2021-12-28 05:41:06,299 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2021-12-28 05:41:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:06,299 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2021-12-28 05:41:06,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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) [2021-12-28 05:41:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2021-12-28 05:41:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:41:06,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:06,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:06,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:41:06,301 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2021-12-28 05:41:06,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218239806] [2021-12-28 05:41:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:06,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:06,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:06,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218239806] [2021-12-28 05:41:06,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218239806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:06,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:06,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:41:06,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878608255] [2021-12-28 05:41:06,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:06,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:41:06,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:41:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:06,568 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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) [2021-12-28 05:41:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:07,102 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2021-12-28 05:41:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:41:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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 28 [2021-12-28 05:41:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:07,104 INFO L225 Difference]: With dead ends: 217 [2021-12-28 05:41:07,104 INFO L226 Difference]: Without dead ends: 217 [2021-12-28 05:41:07,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:41:07,104 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 217 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:07,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 341 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:41:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-28 05:41:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2021-12-28 05:41:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 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) [2021-12-28 05:41:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2021-12-28 05:41:07,107 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2021-12-28 05:41:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:07,107 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2021-12-28 05:41:07,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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) [2021-12-28 05:41:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2021-12-28 05:41:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 05:41:07,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:07,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:07,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:41:07,108 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-12-28 05:41:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2021-12-28 05:41:07,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:07,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866937749] [2021-12-28 05:41:07,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:07,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:41:07,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 05:41:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:41:07,220 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 05:41:07,220 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 05:41:07,222 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2021-12-28 05:41:07,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (62 of 64 remaining) [2021-12-28 05:41:07,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (61 of 64 remaining) [2021-12-28 05:41:07,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (60 of 64 remaining) [2021-12-28 05:41:07,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (59 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (58 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (57 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (56 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (55 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (54 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (53 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (52 of 64 remaining) [2021-12-28 05:41:07,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (51 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (50 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (49 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (48 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (47 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (46 of 64 remaining) [2021-12-28 05:41:07,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (45 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (44 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (43 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (42 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (41 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (40 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (39 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (38 of 64 remaining) [2021-12-28 05:41:07,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (37 of 64 remaining) [2021-12-28 05:41:07,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (36 of 64 remaining) [2021-12-28 05:41:07,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (35 of 64 remaining) [2021-12-28 05:41:07,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (34 of 64 remaining) [2021-12-28 05:41:07,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (33 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (32 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (31 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (30 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (29 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (28 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (27 of 64 remaining) [2021-12-28 05:41:07,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (26 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (25 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (24 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (23 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (22 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (21 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (20 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (19 of 64 remaining) [2021-12-28 05:41:07,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (18 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (17 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (16 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (15 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (14 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (13 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (12 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (11 of 64 remaining) [2021-12-28 05:41:07,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (10 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (9 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (8 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (7 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (6 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (5 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (4 of 64 remaining) [2021-12-28 05:41:07,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (3 of 64 remaining) [2021-12-28 05:41:07,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (2 of 64 remaining) [2021-12-28 05:41:07,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (1 of 64 remaining) [2021-12-28 05:41:07,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (0 of 64 remaining) [2021-12-28 05:41:07,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:41:07,257 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:07,264 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 05:41:07,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:41:07 BoogieIcfgContainer [2021-12-28 05:41:07,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 05:41:07,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 05:41:07,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 05:41:07,302 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 05:41:07,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:01" (3/4) ... [2021-12-28 05:41:07,303 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 05:41:07,324 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 05:41:07,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 05:41:07,325 INFO L158 Benchmark]: Toolchain (without parser) took 7393.91ms. Allocated memory was 58.7MB in the beginning and 111.1MB in the end (delta: 52.4MB). Free memory was 36.9MB in the beginning and 36.0MB in the end (delta: 940.0kB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,325 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:41:07,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.55ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 36.7MB in the beginning and 63.1MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.11ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 60.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,326 INFO L158 Benchmark]: Boogie Preprocessor took 48.61ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 59.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,326 INFO L158 Benchmark]: RCFGBuilder took 491.32ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 60.9MB in the end (delta: -1.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,326 INFO L158 Benchmark]: TraceAbstraction took 6189.07ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 60.5MB in the beginning and 38.0MB in the end (delta: 22.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,327 INFO L158 Benchmark]: Witness Printer took 23.11ms. Allocated memory is still 111.1MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:07,328 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.55ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 36.7MB in the beginning and 63.1MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.11ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 60.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.61ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 59.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.32ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 60.9MB in the end (delta: -1.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6189.07ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 60.5MB in the beginning and 38.0MB in the end (delta: 22.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Witness Printer took 23.11ms. Allocated memory is still 111.1MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1037]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) VAL [head={-1:0}] [L1006] head->prev = ((void*)0) VAL [head={-1:0}] [L1007] head->data = 0 VAL [head={-1:0}] [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 VAL [head={-1:0}, x={-1:0}] [L1022] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1023] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1023] x->next->prev = x VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] x->next->data = 2 VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1036] x = x->next [L1037] EXPR x->data VAL [head={-1:0}, x={-2:0}, x->data=2] [L1037] COND TRUE !(2 != x->data) [L1037] reach_error() VAL [head={-1:0}, x={-2:0}] - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2355 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2355 mSDsluCounter, 3968 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2656 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4215 IncrementalHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 1312 mSDtfsCounter, 4215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=3, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 454 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 05:41:07,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)