./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-16 01:41:35,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:41:35,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:41:35,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:41:35,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:41:35,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:41:35,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:41:35,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:41:35,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:41:35,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:41:35,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:41:35,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:41:35,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:41:35,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:41:35,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:41:35,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:41:35,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:41:35,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:41:35,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:41:35,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:41:35,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:41:35,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:41:35,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:41:35,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:41:35,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:41:35,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:41:35,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:41:35,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:41:35,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:41:35,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:41:35,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:41:35,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:41:35,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:41:35,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:41:35,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:41:35,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:41:35,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:41:35,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:41:35,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:41:35,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:41:35,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:41:35,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:41:35,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:41:35,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:41:35,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:41:35,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:41:35,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:41:35,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:41:35,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:41:35,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:41:35,708 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:41:35,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:41:35,709 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:41:35,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:41:35,710 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:41:35,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:41:35,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:41:35,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:41:35,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:41:35,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:41:35,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:41:35,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:41:35,713 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:41:35,713 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:41:35,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:41:35,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:41:35,714 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-16 01:41:35,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:41:35,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:41:35,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:41:35,921 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:41:35,921 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:41:35,922 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-16 01:41:35,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb671798f/f649ab2540e84dbbac4fa6f8eb670cfc/FLAG78d917cba [2021-12-16 01:41:36,303 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:41:36,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-16 01:41:36,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb671798f/f649ab2540e84dbbac4fa6f8eb670cfc/FLAG78d917cba [2021-12-16 01:41:36,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb671798f/f649ab2540e84dbbac4fa6f8eb670cfc [2021-12-16 01:41:36,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:41:36,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:41:36,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:41:36,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:41:36,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:41:36,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9f88dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36, skipping insertion in model container [2021-12-16 01:41:36,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:41:36,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:41:36,867 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-16 01:41:36,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:41:36,875 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:41:36,892 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-16 01:41:36,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:41:36,904 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:41:36,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36 WrapperNode [2021-12-16 01:41:36,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:41:36,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:41:36,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:41:36,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:41:36,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,941 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-16 01:41:36,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:41:36,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:41:36,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:41:36,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:41:36,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:41:36,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:41:36,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:41:36,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:41:36,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (1/1) ... [2021-12-16 01:41:36,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:41:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:41:36,999 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-16 01:41:37,023 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-16 01:41:37,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:41:37,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:41:37,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:41:37,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:41:37,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-16 01:41:37,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-16 01:41:37,073 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:41:37,075 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:41:37,188 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:41:37,193 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:41:37,193 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 01:41:37,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:41:37 BoogieIcfgContainer [2021-12-16 01:41:37,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:41:37,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:41:37,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:41:37,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:41:37,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:41:36" (1/3) ... [2021-12-16 01:41:37,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f260fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:41:37, skipping insertion in model container [2021-12-16 01:41:37,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:41:36" (2/3) ... [2021-12-16 01:41:37,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f260fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:41:37, skipping insertion in model container [2021-12-16 01:41:37,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:41:37" (3/3) ... [2021-12-16 01:41:37,204 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-16 01:41:37,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:41:37,207 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:41:37,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:41:37,263 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-16 01:41:37,264 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:41:37,284 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-16 01:41:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-16 01:41:37,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:41:37,298 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-16 01:41:37,299 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:41:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:41:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-16 01:41:37,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:41:37,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890047102] [2021-12-16 01:41:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:41:37,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:41:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:41:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:41:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:41:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 01:41:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 01:41:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 01:41:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 01:41:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:41:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:41:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:41:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 01:41:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:41:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:41:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:41:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 01:41:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 01:41:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:41:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 01:41:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 01:41:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-16 01:41:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-16 01:41:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 01:41:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:41:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-16 01:41:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-16 01:41:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-16 01:41:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 01:41:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 01:41:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-16 01:41:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-16 01:41:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-16 01:41:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-16 01:41:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-16 01:41:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-16 01:41:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-16 01:41:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-16 01:41:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-16 01:41:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-16 01:41:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:37,794 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-16 01:41:37,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:41:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890047102] [2021-12-16 01:41:37,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890047102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:41:37,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:41:37,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 01:41:37,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913418727] [2021-12-16 01:41:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:41:37,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 01:41:37,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:41:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 01:41:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 01:41:37,833 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-16 01:41:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:41:37,876 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-16 01:41:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 01:41:37,878 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-16 01:41:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:41:37,885 INFO L225 Difference]: With dead ends: 134 [2021-12-16 01:41:37,885 INFO L226 Difference]: Without dead ends: 67 [2021-12-16 01:41:37,892 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-16 01:41:37,898 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-16 01:41:37,899 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-16 01:41:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-16 01:41:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-16 01:41:37,939 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-16 01:41:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-16 01:41:37,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-16 01:41:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:41:37,943 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-16 01:41:37,943 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-16 01:41:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-16 01:41:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-16 01:41:37,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:41:37,957 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-16 01:41:37,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:41:37,958 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:41:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:41:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-16 01:41:37,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:41:37,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292716223] [2021-12-16 01:41:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:41:37,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:41:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:41:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:41:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:41:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 01:41:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 01:41:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 01:41:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 01:41:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:41:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:41:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:41:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 01:41:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:41:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:41:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:41:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 01:41:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 01:41:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:41:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 01:41:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 01:41:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-16 01:41:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-16 01:41:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 01:41:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:41:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-16 01:41:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-16 01:41:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-16 01:41:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 01:41:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 01:41:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-16 01:41:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-16 01:41:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-16 01:41:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-16 01:41:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-16 01:41:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-16 01:41:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-16 01:41:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-16 01:41:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-16 01:41:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-16 01:41:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,804 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-16 01:41:39,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:41:39,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292716223] [2021-12-16 01:41:39,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292716223] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:41:39,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570667463] [2021-12-16 01:41:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:41:39,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:41:39,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:41:39,807 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-16 01:41:39,841 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-16 01:41:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-16 01:41:39,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:41:41,544 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-16 01:41:41,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:41:43,795 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-16 01:41:43,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570667463] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:41:43,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:41:43,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 22] total 63 [2021-12-16 01:41:43,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693229885] [2021-12-16 01:41:43,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:41:43,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-16 01:41:43,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:41:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-16 01:41:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2021-12-16 01:41:43,800 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-16 01:41:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:41:50,879 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2021-12-16 01:41:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-16 01:41:50,880 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-16 01:41:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:41:50,883 INFO L225 Difference]: With dead ends: 117 [2021-12-16 01:41:50,883 INFO L226 Difference]: Without dead ends: 109 [2021-12-16 01:41:50,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 465 SyntacticMatches, 21 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1780, Invalid=7726, Unknown=0, NotChecked=0, Total=9506 [2021-12-16 01:41:50,887 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.6s IncrementalHoareTripleChecker+Time [2021-12-16 01:41:50,887 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.6s Time] [2021-12-16 01:41:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-16 01:41:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-16 01:41:50,900 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-16 01:41:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-16 01:41:50,901 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-16 01:41:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:41:50,903 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-16 01:41:50,904 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-16 01:41:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-16 01:41:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-16 01:41:50,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:41:50,911 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-16 01:41:50,933 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-16 01:41:51,123 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-16 01:41:51,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:41:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:41:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-16 01:41:51,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:41:51,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041066939] [2021-12-16 01:41:51,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:41:51,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:41:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:41:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:41:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:41:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 01:41:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 01:41:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 01:41:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 01:41:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:41:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:41:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:41:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 01:41:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-16 01:41:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:41:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:41:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 01:41:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 01:41:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:41:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 01:41:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 01:41:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-16 01:41:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-16 01:41:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 01:41:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:41:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-16 01:41:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-16 01:41:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-16 01:41:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 01:41:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 01:41:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-16 01:41:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-16 01:41:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-16 01:41:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-16 01:41:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-16 01:41:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-16 01:41:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-16 01:41:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-16 01:41:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-16 01:41:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-16 01:41:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,775 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-16 01:41:52,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:41:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041066939] [2021-12-16 01:41:52,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041066939] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:41:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503384008] [2021-12-16 01:41:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:41:52,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:41:52,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:41:52,777 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-16 01:41:52,778 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-16 01:41:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:41:52,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-16 01:41:52,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:41:54,507 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-16 01:41:54,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:41:57,613 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-16 01:41:57,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503384008] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:41:57,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:41:57,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 23] total 60 [2021-12-16 01:41:57,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241668967] [2021-12-16 01:41:57,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:41:57,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-16 01:41:57,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:41:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-16 01:41:57,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3240, Unknown=0, NotChecked=0, Total=3540 [2021-12-16 01:41:57,616 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-16 01:42:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:42:03,316 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-16 01:42:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-16 01:42:03,317 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-16 01:42:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:42:03,318 INFO L225 Difference]: With dead ends: 113 [2021-12-16 01:42:03,318 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 01:42:03,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 459 SyntacticMatches, 24 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1526, Invalid=6130, Unknown=0, NotChecked=0, Total=7656 [2021-12-16 01:42:03,320 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-16 01:42:03,321 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-16 01:42:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 01:42:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-16 01:42:03,336 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-16 01:42:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-16 01:42:03,338 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-16 01:42:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:42:03,340 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-16 01:42:03,340 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-16 01:42:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-16 01:42:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-16 01:42:03,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:42:03,343 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-16 01:42:03,361 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-16 01:42:03,560 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-16 01:42:03,561 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:42:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:42:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-16 01:42:03,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:42:03,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48705339] [2021-12-16 01:42:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:42:03,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:42:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:42:03,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:42:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:42:03,716 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:42:03,717 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:42:03,717 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:42:03,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:42:03,721 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-16 01:42:03,723 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:42:03,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:42:03 BoogieIcfgContainer [2021-12-16 01:42:03,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:42:03,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:42:03,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:42:03,783 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:42:03,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:41:37" (3/4) ... [2021-12-16 01:42:03,784 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:42:03,842 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:42:03,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:42:03,842 INFO L158 Benchmark]: Toolchain (without parser) took 27107.26ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 79.8MB in the beginning and 168.2MB in the end (delta: -88.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,843 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 63.1MB in the beginning and 63.0MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:42:03,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.81ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 82.0MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.52ms. Allocated memory is still 107.0MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,843 INFO L158 Benchmark]: Boogie Preprocessor took 24.40ms. Allocated memory is still 107.0MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,844 INFO L158 Benchmark]: RCFGBuilder took 226.93ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 67.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,844 INFO L158 Benchmark]: TraceAbstraction took 26586.53ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 66.7MB in the beginning and 176.6MB in the end (delta: -109.9MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,844 INFO L158 Benchmark]: Witness Printer took 59.55ms. Allocated memory is still 226.5MB. Free memory was 176.6MB in the beginning and 168.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:42:03,846 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 107.0MB. Free memory was 63.1MB in the beginning and 63.0MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.81ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 82.0MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.52ms. Allocated memory is still 107.0MB. Free memory was 82.0MB in the beginning and 80.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.40ms. Allocated memory is still 107.0MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 226.93ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 67.4MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26586.53ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 66.7MB in the beginning and 176.6MB in the end (delta: -109.9MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. * Witness Printer took 59.55ms. Allocated memory is still 226.5MB. Free memory was 176.6MB in the beginning and 168.2MB 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.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 4197 SdHoareTripleChecker+Invalid, 2.5s 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.5s 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.3s 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-16 01:42:03,871 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