./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-005.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 13:59:28,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 13:59:28,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 13:59:28,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 13:59:28,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 13:59:28,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 13:59:28,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 13:59:28,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 13:59:28,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 13:59:28,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 13:59:28,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 13:59:28,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 13:59:28,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 13:59:28,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 13:59:28,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 13:59:28,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 13:59:28,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 13:59:28,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 13:59:28,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 13:59:28,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 13:59:28,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 13:59:28,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 13:59:28,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 13:59:28,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 13:59:28,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 13:59:28,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 13:59:28,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 13:59:28,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 13:59:28,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 13:59:28,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 13:59:28,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 13:59:28,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 13:59:28,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 13:59:28,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 13:59:28,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 13:59:28,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 13:59:28,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 13:59:28,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 13:59:28,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 13:59:28,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 13:59:28,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 13:59:28,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 13:59:28,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 13:59:28,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 13:59:28,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 13:59:28,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 13:59:28,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 13:59:28,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 13:59:28,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 13:59:28,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 13:59:28,776 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 13:59:28,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 13:59:28,777 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 13:59:28,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 13:59:28,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 13:59:28,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 13:59:28,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 13:59:28,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 13:59:28,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 13:59:28,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 13:59:28,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 13:59:28,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:59:28,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 13:59:28,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 13:59:28,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 13:59:28,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 13:59:28,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 13:59:28,781 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 13:59:28,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 13:59:28,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 13:59:28,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 13:59:28,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2021-12-21 13:59:28,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 13:59:29,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 13:59:29,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 13:59:29,013 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 13:59:29,014 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 13:59:29,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-21 13:59:29,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec38597a/82df0be34a3740629110d500b3b57ebc/FLAGab6474841 [2021-12-21 13:59:29,368 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 13:59:29,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-21 13:59:29,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec38597a/82df0be34a3740629110d500b3b57ebc/FLAGab6474841 [2021-12-21 13:59:29,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec38597a/82df0be34a3740629110d500b3b57ebc [2021-12-21 13:59:29,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 13:59:29,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 13:59:29,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 13:59:29,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 13:59:29,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 13:59:29,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:29,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff299aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29, skipping insertion in model container [2021-12-21 13:59:29,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:29,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 13:59:29,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 13:59:29,939 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/xcsp/AllInterval-005.c[2566,2579] [2021-12-21 13:59:29,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:59:29,954 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 13:59:29,976 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/xcsp/AllInterval-005.c[2566,2579] [2021-12-21 13:59:29,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:59:29,993 INFO L208 MainTranslator]: Completed translation [2021-12-21 13:59:29,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29 WrapperNode [2021-12-21 13:59:29,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 13:59:29,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 13:59:29,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 13:59:29,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 13:59:29,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,031 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-21 13:59:30,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 13:59:30,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 13:59:30,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 13:59:30,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 13:59:30,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 13:59:30,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 13:59:30,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 13:59:30,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 13:59:30,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (1/1) ... [2021-12-21 13:59:30,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:59:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:59:30,078 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-21 13:59:30,084 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-21 13:59:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 13:59:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 13:59:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 13:59:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 13:59:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-21 13:59:30,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-21 13:59:30,151 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 13:59:30,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 13:59:30,264 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 13:59:30,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 13:59:30,269 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 13:59:30,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:59:30 BoogieIcfgContainer [2021-12-21 13:59:30,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 13:59:30,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 13:59:30,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 13:59:30,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 13:59:30,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:59:29" (1/3) ... [2021-12-21 13:59:30,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187afc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:59:30, skipping insertion in model container [2021-12-21 13:59:30,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:59:29" (2/3) ... [2021-12-21 13:59:30,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187afc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:59:30, skipping insertion in model container [2021-12-21 13:59:30,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:59:30" (3/3) ... [2021-12-21 13:59:30,275 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-21 13:59:30,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 13:59:30,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 13:59:30,312 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 13:59:30,316 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 13:59:30,317 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 13:59:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-21 13:59:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-21 13:59:30,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:59:30,348 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:59:30,348 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:59:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:59:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-21 13:59:30,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:59:30,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876296853] [2021-12-21 13:59:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:30,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:59:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:59:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 13:59:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 13:59:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 13:59:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 13:59:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 13:59:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 13:59:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 13:59:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 13:59:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:59:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 13:59:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 13:59:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-21 13:59:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 13:59:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 13:59:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 13:59:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 13:59:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 13:59:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 13:59:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:59:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 13:59:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 13:59:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-21 13:59:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-21 13:59:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-21 13:59:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 13:59:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 13:59:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-21 13:59:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 13:59:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 13:59:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 13:59:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-21 13:59:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-21 13:59:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-21 13:59:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-21 13:59:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 13:59:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-21 13:59:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-21 13:59:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2021-12-21 13:59:30,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:59:30,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876296853] [2021-12-21 13:59:30,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876296853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:59:30,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:59:30,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 13:59:30,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230944643] [2021-12-21 13:59:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:59:30,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 13:59:30,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:59:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 13:59:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 13:59:30,837 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-21 13:59:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:59:30,858 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-21 13:59:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 13:59:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2021-12-21 13:59:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:59:30,865 INFO L225 Difference]: With dead ends: 134 [2021-12-21 13:59:30,865 INFO L226 Difference]: Without dead ends: 67 [2021-12-21 13:59:30,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 13:59:30,870 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:59:30,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:59:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-21 13:59:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-21 13:59:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-21 13:59:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-21 13:59:30,902 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-21 13:59:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:59:30,902 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-21 13:59:30,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-21 13:59:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-21 13:59:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-21 13:59:30,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:59:30,907 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:59:30,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 13:59:30,908 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:59:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:59:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-21 13:59:30,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:59:30,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111221684] [2021-12-21 13:59:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:30,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:59:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:59:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 13:59:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 13:59:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 13:59:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 13:59:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 13:59:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 13:59:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 13:59:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 13:59:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:59:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 13:59:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 13:59:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-21 13:59:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 13:59:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 13:59:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 13:59:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 13:59:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 13:59:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 13:59:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:59:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 13:59:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 13:59:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-21 13:59:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-21 13:59:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-21 13:59:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 13:59:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 13:59:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-21 13:59:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 13:59:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 13:59:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 13:59:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-21 13:59:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-21 13:59:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-21 13:59:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-21 13:59:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 13:59:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-21 13:59:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-21 13:59:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 432 proven. 351 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2021-12-21 13:59:32,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:59:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111221684] [2021-12-21 13:59:32,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111221684] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:59:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067798393] [2021-12-21 13:59:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:32,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:59:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:59:32,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:59:32,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 13:59:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-21 13:59:32,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:59:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-21 13:59:33,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:59:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-21 13:59:35,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067798393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:59:35,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:59:35,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 61 [2021-12-21 13:59:35,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239649436] [2021-12-21 13:59:35,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:59:35,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-21 13:59:35,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:59:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-21 13:59:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3388, Unknown=0, NotChecked=0, Total=3660 [2021-12-21 13:59:35,313 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2021-12-21 13:59:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:59:38,461 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2021-12-21 13:59:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-21 13:59:38,462 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) Word has length 214 [2021-12-21 13:59:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:59:38,464 INFO L225 Difference]: With dead ends: 117 [2021-12-21 13:59:38,464 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 13:59:38,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1427, Invalid=6229, Unknown=0, NotChecked=0, Total=7656 [2021-12-21 13:59:38,466 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 401 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:59:38,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1845 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 13:59:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 13:59:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-21 13:59:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-21 13:59:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-21 13:59:38,481 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-21 13:59:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:59:38,481 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-21 13:59:38,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2021-12-21 13:59:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-21 13:59:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-21 13:59:38,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:59:38,484 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:59:38,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 13:59:38,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:59:38,700 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:59:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:59:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-21 13:59:38,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:59:38,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851186249] [2021-12-21 13:59:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:38,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:59:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:59:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 13:59:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 13:59:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 13:59:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 13:59:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 13:59:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-21 13:59:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 13:59:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 13:59:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:59:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-21 13:59:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 13:59:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-21 13:59:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 13:59:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-21 13:59:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 13:59:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 13:59:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 13:59:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 13:59:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:59:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 13:59:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-21 13:59:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-21 13:59:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-21 13:59:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-21 13:59:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 13:59:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 13:59:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-21 13:59:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 13:59:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 13:59:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 13:59:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-21 13:59:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-21 13:59:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-21 13:59:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-21 13:59:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 13:59:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-21 13:59:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-21 13:59:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 573 proven. 318 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-21 13:59:39,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:59:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851186249] [2021-12-21 13:59:39,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851186249] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:59:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929345254] [2021-12-21 13:59:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:39,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:59:39,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:59:39,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:59:39,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 13:59:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:59:39,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-21 13:59:39,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:59:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 724 proven. 282 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2021-12-21 13:59:43,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:59:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 576 proven. 315 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-21 13:59:46,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929345254] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:59:46,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:59:46,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 58 [2021-12-21 13:59:46,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079321930] [2021-12-21 13:59:46,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:59:46,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-21 13:59:46,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:59:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-21 13:59:46,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3034, Unknown=1, NotChecked=0, Total=3306 [2021-12-21 13:59:46,261 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2021-12-21 13:59:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:59:53,860 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-21 13:59:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-21 13:59:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) Word has length 214 [2021-12-21 13:59:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:59:53,863 INFO L225 Difference]: With dead ends: 113 [2021-12-21 13:59:53,863 INFO L226 Difference]: Without dead ends: 101 [2021-12-21 13:59:53,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1462, Invalid=6019, Unknown=1, NotChecked=0, Total=7482 [2021-12-21 13:59:53,865 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 314 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:59:53,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1694 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1590 Invalid, 0 Unknown, 119 Unchecked, 1.1s Time] [2021-12-21 13:59:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-21 13:59:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-21 13:59:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-12-21 13:59:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-21 13:59:53,892 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-21 13:59:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:59:53,895 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-21 13:59:53,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2021-12-21 13:59:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-21 13:59:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-21 13:59:53,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:59:53,900 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:59:53,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 13:59:54,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-21 13:59:54,118 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:59:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:59:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-21 13:59:54,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:59:54,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802538847] [2021-12-21 13:59:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:59:54,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:59:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:59:54,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 13:59:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:59:54,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 13:59:54,326 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 13:59:54,327 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 13:59:54,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 13:59:54,331 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-21 13:59:54,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 13:59:54,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:59:54 BoogieIcfgContainer [2021-12-21 13:59:54,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 13:59:54,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 13:59:54,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 13:59:54,385 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 13:59:54,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:59:30" (3/4) ... [2021-12-21 13:59:54,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 13:59:54,445 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 13:59:54,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 13:59:54,446 INFO L158 Benchmark]: Toolchain (without parser) took 24661.41ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 77.0MB in the beginning and 84.0MB in the end (delta: -6.9MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,446 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 79.7MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:59:54,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.16ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 84.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,447 INFO L158 Benchmark]: Boogie Preprocessor took 18.08ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,447 INFO L158 Benchmark]: RCFGBuilder took 218.91ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 69.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,447 INFO L158 Benchmark]: TraceAbstraction took 24112.97ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 69.0MB in the beginning and 92.4MB in the end (delta: -23.3MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,448 INFO L158 Benchmark]: Witness Printer took 61.07ms. Allocated memory is still 234.9MB. Free memory was 92.4MB in the beginning and 84.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:59:54,449 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.10ms. Allocated memory is still 79.7MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.16ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 84.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.08ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.91ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 69.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24112.97ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 69.0MB in the beginning and 92.4MB in the end (delta: -23.3MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. * Witness Printer took 61.07ms. Allocated memory is still 234.9MB. Free memory was 92.4MB in the beginning and 84.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=1, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=2, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=4, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=3, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 3646 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119 IncrementalHoareTripleChecker+Unchecked, 3404 mSDsCounter, 821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 821 mSolverCounterUnsat, 242 mSDtfsCounter, 3546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1243 GetRequests, 1071 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 74, 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, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 3 QuantifiedInterpolants, 10227 SizeOfPredicates, 67 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17704/19684 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-21 13:59:54,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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