./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-17 17:26:21,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 17:26:21,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 17:26:21,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 17:26:21,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 17:26:21,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 17:26:21,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 17:26:21,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 17:26:21,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 17:26:21,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 17:26:21,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 17:26:21,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 17:26:21,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 17:26:21,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 17:26:21,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 17:26:21,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 17:26:21,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 17:26:21,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 17:26:21,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 17:26:21,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 17:26:21,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 17:26:21,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 17:26:21,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 17:26:21,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 17:26:21,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 17:26:21,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 17:26:21,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 17:26:21,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 17:26:21,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 17:26:21,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 17:26:21,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 17:26:21,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 17:26:21,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 17:26:21,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 17:26:21,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 17:26:21,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 17:26:21,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 17:26:21,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 17:26:21,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 17:26:21,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 17:26:21,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 17:26:21,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 17:26:21,998 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 17:26:21,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 17:26:21,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 17:26:21,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 17:26:21,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 17:26:21,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 17:26:22,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 17:26:22,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 17:26:22,000 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 17:26:22,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 17:26:22,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 17:26:22,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 17:26:22,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 17:26:22,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 17:26:22,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 17:26:22,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:26:22,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 17:26:22,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 17:26:22,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 17:26:22,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 17:26:22,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 17:26:22,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 17:26:22,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 17:26:22,004 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-17 17:26:22,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 17:26:22,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 17:26:22,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 17:26:22,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 17:26:22,224 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 17:26:22,225 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-17 17:26:22,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b7a009e/87325c89988c4809a00ae7425b2ac862/FLAG76415504d [2021-12-17 17:26:22,631 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 17:26:22,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-17 17:26:22,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b7a009e/87325c89988c4809a00ae7425b2ac862/FLAG76415504d [2021-12-17 17:26:22,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b7a009e/87325c89988c4809a00ae7425b2ac862 [2021-12-17 17:26:22,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 17:26:22,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 17:26:22,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 17:26:22,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 17:26:22,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 17:26:22,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5090a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22, skipping insertion in model container [2021-12-17 17:26:22,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 17:26:22,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 17:26:22,786 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-17 17:26:22,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:26:22,793 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 17:26:22,808 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-17 17:26:22,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:26:22,817 INFO L208 MainTranslator]: Completed translation [2021-12-17 17:26:22,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22 WrapperNode [2021-12-17 17:26:22,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 17:26:22,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 17:26:22,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 17:26:22,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 17:26:22,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,840 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-17 17:26:22,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 17:26:22,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 17:26:22,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 17:26:22,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 17:26:22,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 17:26:22,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 17:26:22,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 17:26:22,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 17:26:22,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (1/1) ... [2021-12-17 17:26:22,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:26:22,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 17:26:22,877 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-17 17:26:22,899 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-17 17:26:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 17:26:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 17:26:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 17:26:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 17:26:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-17 17:26:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-17 17:26:22,955 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 17:26:22,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 17:26:23,062 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 17:26:23,069 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 17:26:23,070 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 17:26:23,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:26:23 BoogieIcfgContainer [2021-12-17 17:26:23,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 17:26:23,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 17:26:23,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 17:26:23,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 17:26:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 05:26:22" (1/3) ... [2021-12-17 17:26:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f389f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:26:23, skipping insertion in model container [2021-12-17 17:26:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:26:22" (2/3) ... [2021-12-17 17:26:23,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f389f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:26:23, skipping insertion in model container [2021-12-17 17:26:23,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:26:23" (3/3) ... [2021-12-17 17:26:23,092 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-17 17:26:23,095 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 17:26:23,095 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 17:26:23,124 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 17:26:23,129 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-17 17:26:23,129 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 17:26:23,141 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-17 17:26:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-17 17:26:23,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:26:23,160 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-17 17:26:23,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:26:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:26:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-17 17:26:23,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:26:23,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433276296] [2021-12-17 17:26:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:23,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:26:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 17:26:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 17:26:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 17:26:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 17:26:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-17 17:26:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 17:26:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 17:26:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 17:26:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-17 17:26:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 17:26:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-17 17:26:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-17 17:26:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 17:26:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 17:26:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 17:26:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 17:26:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 17:26:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 17:26:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 17:26:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 17:26:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 17:26:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 17:26:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 17:26:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-17 17:26:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 17:26:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 17:26:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-17 17:26:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 17:26:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-17 17:26:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 17:26:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 17:26:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-17 17:26:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-17 17:26:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-17 17:26:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-17 17:26:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-17 17:26:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 17:26:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 17:26:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:23,657 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-17 17:26:23,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 17:26:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433276296] [2021-12-17 17:26:23,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433276296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 17:26:23,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 17:26:23,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 17:26:23,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324865076] [2021-12-17 17:26:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 17:26:23,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 17:26:23,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 17:26:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 17:26:23,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 17:26:23,686 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-17 17:26:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 17:26:23,722 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-17 17:26:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 17:26:23,724 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-17 17:26:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 17:26:23,732 INFO L225 Difference]: With dead ends: 134 [2021-12-17 17:26:23,732 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 17:26:23,738 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-17 17:26:23,742 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-17 17:26:23,743 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-17 17:26:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 17:26:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-17 17:26:23,809 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-17 17:26:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-17 17:26:23,813 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-17 17:26:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 17:26:23,814 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-17 17:26:23,814 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-17 17:26:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-17 17:26:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-17 17:26:23,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:26:23,822 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-17 17:26:23,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 17:26:23,822 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:26:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:26:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-17 17:26:23,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:26:23,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884771740] [2021-12-17 17:26:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:23,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:26:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 17:26:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 17:26:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 17:26:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 17:26:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-17 17:26:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 17:26:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 17:26:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 17:26:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-17 17:26:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 17:26:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-17 17:26:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-17 17:26:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 17:26:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 17:26:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 17:26:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 17:26:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 17:26:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 17:26:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 17:26:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 17:26:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 17:26:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 17:26:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 17:26:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-17 17:26:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 17:26:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 17:26:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-17 17:26:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 17:26:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-17 17:26:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 17:26:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 17:26:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-17 17:26:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-17 17:26:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-17 17:26:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-17 17:26:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-17 17:26:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 17:26:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 17:26:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 597 proven. 411 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2021-12-17 17:26:25,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 17:26:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884771740] [2021-12-17 17:26:25,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884771740] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 17:26:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106558623] [2021-12-17 17:26:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:25,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 17:26:25,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 17:26:25,699 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-17 17:26:25,702 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-17 17:26:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:25,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-17 17:26:25,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 17:26:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 610 proven. 294 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2021-12-17 17:26:27,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 17:26:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 462 proven. 321 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2021-12-17 17:26:29,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106558623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 17:26:29,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 17:26:29,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 22] total 63 [2021-12-17 17:26:29,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539735823] [2021-12-17 17:26:29,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 17:26:29,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-17 17:26:29,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 17:26:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-17 17:26:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2021-12-17 17:26:29,772 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 63 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 36 states have call successors, (101), 2 states have call predecessors, (101), 3 states have return successors, (103), 34 states have call predecessors, (103), 36 states have call successors, (103) [2021-12-17 17:26:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 17:26:36,867 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2021-12-17 17:26:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-17 17:26:36,868 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 36 states have call successors, (101), 2 states have call predecessors, (101), 3 states have return successors, (103), 34 states have call predecessors, (103), 36 states have call successors, (103) Word has length 214 [2021-12-17 17:26:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 17:26:36,869 INFO L225 Difference]: With dead ends: 117 [2021-12-17 17:26:36,869 INFO L226 Difference]: Without dead ends: 109 [2021-12-17 17:26:36,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 465 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1780, Invalid=7726, Unknown=0, NotChecked=0, Total=9506 [2021-12-17 17:26:36,873 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 436 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-17 17:26:36,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 2227 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-17 17:26:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-17 17:26:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-17 17:26:36,893 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-17 17:26:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-17 17:26:36,894 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-17 17:26:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 17:26:36,895 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-17 17:26:36,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 41 states have internal predecessors, (70), 36 states have call successors, (101), 2 states have call predecessors, (101), 3 states have return successors, (103), 34 states have call predecessors, (103), 36 states have call successors, (103) [2021-12-17 17:26:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-17 17:26:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-17 17:26:36,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:26:36,898 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-17 17:26:36,919 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-17 17:26:37,111 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-17 17:26:37,112 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:26:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:26:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-17 17:26:37,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:26:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16329898] [2021-12-17 17:26:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:37,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:26:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 17:26:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 17:26:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 17:26:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 17:26:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-17 17:26:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 17:26:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 17:26:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 17:26:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-17 17:26:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 17:26:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-17 17:26:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-17 17:26:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 17:26:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 17:26:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 17:26:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 17:26:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 17:26:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 17:26:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 17:26:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 17:26:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 17:26:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 17:26:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 17:26:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-17 17:26:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 17:26:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 17:26:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-17 17:26:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 17:26:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-17 17:26:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 17:26:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 17:26:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-17 17:26:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-17 17:26:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-17 17:26:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-17 17:26:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-17 17:26:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 17:26:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 17:26:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 627 proven. 309 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2021-12-17 17:26:38,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 17:26:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16329898] [2021-12-17 17:26:38,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16329898] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 17:26:38,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791028822] [2021-12-17 17:26:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:38,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 17:26:38,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 17:26:38,783 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-17 17:26:38,784 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-17 17:26:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:26:38,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 17:26:38,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 17:26:40,518 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-17 17:26:40,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 17:26:43,451 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-17 17:26:43,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791028822] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 17:26:43,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 17:26:43,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 23] total 60 [2021-12-17 17:26:43,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941268604] [2021-12-17 17:26:43,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 17:26:43,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-17 17:26:43,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 17:26:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-17 17:26:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3240, Unknown=0, NotChecked=0, Total=3540 [2021-12-17 17:26:43,456 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 60 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 39 states have internal predecessors, (68), 37 states have call successors, (106), 2 states have call predecessors, (106), 3 states have return successors, (107), 35 states have call predecessors, (107), 37 states have call successors, (107) [2021-12-17 17:26:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 17:26:49,184 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-17 17:26:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-17 17:26:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 39 states have internal predecessors, (68), 37 states have call successors, (106), 2 states have call predecessors, (106), 3 states have return successors, (107), 35 states have call predecessors, (107), 37 states have call successors, (107) Word has length 214 [2021-12-17 17:26:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 17:26:49,188 INFO L225 Difference]: With dead ends: 113 [2021-12-17 17:26:49,189 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 17:26:49,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 459 SyntacticMatches, 24 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1526, Invalid=6130, Unknown=0, NotChecked=0, Total=7656 [2021-12-17 17:26:49,191 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 256 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-17 17:26:49,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 1863 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-17 17:26:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 17:26:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-17 17:26:49,200 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-17 17:26:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-17 17:26:49,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-17 17:26:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 17:26:49,201 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-17 17:26:49,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 39 states have internal predecessors, (68), 37 states have call successors, (106), 2 states have call predecessors, (106), 3 states have return successors, (107), 35 states have call predecessors, (107), 37 states have call successors, (107) [2021-12-17 17:26:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-17 17:26:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-17 17:26:49,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:26:49,204 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-17 17:26:49,221 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-17 17:26:49,420 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-17 17:26:49,420 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:26:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:26:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-17 17:26:49,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:26:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382173373] [2021-12-17 17:26:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:26:49,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:26:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 17:26:49,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 17:26:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 17:26:49,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 17:26:49,568 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 17:26:49,569 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 17:26:49,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 17:26:49,575 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-17 17:26:49,577 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 17:26:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 05:26:49 BoogieIcfgContainer [2021-12-17 17:26:49,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 17:26:49,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 17:26:49,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 17:26:49,650 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 17:26:49,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:26:23" (3/4) ... [2021-12-17 17:26:49,651 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 17:26:49,728 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 17:26:49,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 17:26:49,729 INFO L158 Benchmark]: Toolchain (without parser) took 27080.45ms. Allocated memory was 119.5MB in the beginning and 224.4MB in the end (delta: 104.9MB). Free memory was 85.9MB in the beginning and 106.6MB in the end (delta: -20.7MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,729 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory was 37.7MB in the beginning and 37.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 17:26:49,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.45ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 93.6MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.34ms. Allocated memory is still 119.5MB. Free memory was 93.6MB in the beginning and 92.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 17:26:49,730 INFO L158 Benchmark]: Boogie Preprocessor took 13.15ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,730 INFO L158 Benchmark]: RCFGBuilder took 216.24ms. Allocated memory is still 119.5MB. Free memory was 90.8MB in the beginning and 78.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,731 INFO L158 Benchmark]: TraceAbstraction took 26576.54ms. Allocated memory was 119.5MB in the beginning and 224.4MB in the end (delta: 104.9MB). Free memory was 78.2MB in the beginning and 115.0MB in the end (delta: -36.7MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,731 INFO L158 Benchmark]: Witness Printer took 79.44ms. Allocated memory is still 224.4MB. Free memory was 115.0MB in the beginning and 106.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 17:26:49,732 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.17ms. Allocated memory is still 77.6MB. Free memory was 37.7MB in the beginning and 37.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.45ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 93.6MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.34ms. Allocated memory is still 119.5MB. Free memory was 93.6MB in the beginning and 92.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.15ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 216.24ms. Allocated memory is still 119.5MB. Free memory was 90.8MB in the beginning and 78.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26576.54ms. Allocated memory was 119.5MB in the beginning and 224.4MB in the end (delta: 104.9MB). Free memory was 78.2MB in the beginning and 115.0MB in the end (delta: -36.7MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 79.44ms. Allocated memory is still 224.4MB. Free memory was 115.0MB in the beginning and 106.6MB 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: 26.5s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 4197 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3941 mSDsCounter, 976 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4280 IncrementalHoareTripleChecker+Invalid, 5256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 976 mSolverCounterUnsat, 256 mSDtfsCounter, 4280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1267 GetRequests, 1040 SyntacticMatches, 45 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3711 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 77, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 12677 SizeOfPredicates, 60 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17752/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-17 17:26:49,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE