./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/nla-digbench-scaling/bresenham-ll_unwindbound20.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 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 20:24:50,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 20:24:50,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 20:24:50,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 20:24:50,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 20:24:50,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 20:24:50,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 20:24:50,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 20:24:50,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 20:24:50,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 20:24:50,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 20:24:50,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 20:24:50,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 20:24:50,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 20:24:50,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 20:24:50,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 20:24:50,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 20:24:50,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 20:24:50,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 20:24:50,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 20:24:50,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 20:24:50,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 20:24:50,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 20:24:50,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 20:24:50,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 20:24:50,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 20:24:50,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 20:24:50,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 20:24:50,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 20:24:50,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 20:24:50,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 20:24:50,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 20:24:50,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 20:24:50,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 20:24:50,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 20:24:50,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 20:24:50,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 20:24:50,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 20:24:50,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 20:24:50,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 20:24:50,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 20:24:50,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 20:24:50,882 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 20:24:50,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 20:24:50,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 20:24:50,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 20:24:50,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 20:24:50,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 20:24:50,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 20:24:50,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 20:24:50,884 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 20:24:50,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 20:24:50,884 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 20:24:50,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 20:24:50,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 20:24:50,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 20:24:50,885 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 20:24:50,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 20:24:50,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 20:24:50,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 20:24:50,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 20:24:50,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:24:50,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 20:24:50,887 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 20:24:50,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 20:24:50,888 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 20:24:50,888 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a [2023-02-15 20:24:51,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 20:24:51,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 20:24:51,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 20:24:51,058 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 20:24:51,058 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 20:24:51,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-02-15 20:24:52,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 20:24:52,301 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 20:24:52,303 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-02-15 20:24:52,308 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f1afae3/8f6af19bf166438b8247803236018d09/FLAGa784b20ec [2023-02-15 20:24:52,322 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f1afae3/8f6af19bf166438b8247803236018d09 [2023-02-15 20:24:52,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 20:24:52,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 20:24:52,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 20:24:52,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 20:24:52,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 20:24:52,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525974bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52, skipping insertion in model container [2023-02-15 20:24:52,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 20:24:52,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 20:24:52,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-02-15 20:24:52,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:24:52,489 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 20:24:52,498 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-02-15 20:24:52,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:24:52,525 INFO L208 MainTranslator]: Completed translation [2023-02-15 20:24:52,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52 WrapperNode [2023-02-15 20:24:52,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 20:24:52,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 20:24:52,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 20:24:52,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 20:24:52,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,549 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-15 20:24:52,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 20:24:52,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 20:24:52,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 20:24:52,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 20:24:52,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 20:24:52,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 20:24:52,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 20:24:52,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 20:24:52,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (1/1) ... [2023-02-15 20:24:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:24:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:52,621 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) [2023-02-15 20:24:52,636 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 [2023-02-15 20:24:52,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 20:24:52,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 20:24:52,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 20:24:52,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 20:24:52,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 20:24:52,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 20:24:52,700 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 20:24:52,701 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 20:24:52,783 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 20:24:52,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 20:24:52,787 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 20:24:52,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:24:52 BoogieIcfgContainer [2023-02-15 20:24:52,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 20:24:52,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 20:24:52,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 20:24:52,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 20:24:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 08:24:52" (1/3) ... [2023-02-15 20:24:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32df44df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:24:52, skipping insertion in model container [2023-02-15 20:24:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:24:52" (2/3) ... [2023-02-15 20:24:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32df44df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:24:52, skipping insertion in model container [2023-02-15 20:24:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:24:52" (3/3) ... [2023-02-15 20:24:52,793 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-02-15 20:24:52,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 20:24:52,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 20:24:52,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 20:24:52,833 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6197e7ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 20:24:52,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 20:24:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 20:24:52,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:52,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:52,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-15 20:24:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:52,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001927544] [2023-02-15 20:24:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:52,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:52,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435834402] [2023-02-15 20:24:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:52,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:52,925 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) [2023-02-15 20:24:52,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 20:24:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:24:53,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 20:24:53,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:53,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 20:24:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001927544] [2023-02-15 20:24:53,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435834402] [2023-02-15 20:24:53,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435834402] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:24:53,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:24:53,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 20:24:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994555168] [2023-02-15 20:24:53,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:24:53,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:24:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:24:53,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:24:53,216 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:24:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:53,343 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-15 20:24:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:24:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 20:24:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:53,349 INFO L225 Difference]: With dead ends: 54 [2023-02-15 20:24:53,349 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 20:24:53,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:24:53,353 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:53,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:24:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 20:24:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-15 20:24:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 20:24:53,376 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-15 20:24:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:53,376 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 20:24:53,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:24:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 20:24:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 20:24:53,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:53,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 20:24:53,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-15 20:24:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:53,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625038533] [2023-02-15 20:24:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:53,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:53,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174563984] [2023-02-15 20:24:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:53,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:53,609 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) [2023-02-15 20:24:53,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 20:24:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:24:53,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 20:24:53,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:53,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625038533] [2023-02-15 20:24:54,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174563984] [2023-02-15 20:24:54,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174563984] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:54,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:54,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-15 20:24:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119362464] [2023-02-15 20:24:54,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:54,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 20:24:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 20:24:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 20:24:54,074 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:54,322 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-15 20:24:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 20:24:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-15 20:24:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:54,323 INFO L225 Difference]: With dead ends: 41 [2023-02-15 20:24:54,323 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 20:24:54,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-15 20:24:54,325 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:54,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:24:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 20:24:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 20:24:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 20:24:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 20:24:54,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-15 20:24:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 20:24:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 20:24:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 20:24:54,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:54,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:54,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:54,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 20:24:54,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-15 20:24:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:54,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844220783] [2023-02-15 20:24:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:54,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:54,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520174002] [2023-02-15 20:24:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:54,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:54,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 20:24:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:24:54,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 20:24:54,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:54,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:54,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844220783] [2023-02-15 20:24:54,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:54,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520174002] [2023-02-15 20:24:54,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520174002] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:54,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:54,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-15 20:24:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348019528] [2023-02-15 20:24:54,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:54,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 20:24:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 20:24:54,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:24:54,659 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:54,705 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-15 20:24:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 20:24:54,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-15 20:24:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:54,706 INFO L225 Difference]: With dead ends: 73 [2023-02-15 20:24:54,706 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 20:24:54,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 20:24:54,707 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:54,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:24:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 20:24:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-15 20:24:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 20:24:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-15 20:24:54,716 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-15 20:24:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:54,716 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-15 20:24:54,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:24:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-15 20:24:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 20:24:54,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:54,717 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:54,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 20:24:54,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:54,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-15 20:24:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578175845] [2023-02-15 20:24:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:54,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:54,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476471739] [2023-02-15 20:24:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:54,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:54,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 20:24:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:24:54,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 20:24:54,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 20:24:55,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 20:24:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:55,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578175845] [2023-02-15 20:24:55,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:55,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476471739] [2023-02-15 20:24:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476471739] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:55,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:55,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-15 20:24:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061827460] [2023-02-15 20:24:55,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:55,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 20:24:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 20:24:55,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-15 20:24:55,504 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 20:24:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:56,166 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-15 20:24:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 20:24:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-15 20:24:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:56,167 INFO L225 Difference]: With dead ends: 65 [2023-02-15 20:24:56,167 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 20:24:56,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 20:24:56,169 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:56,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:24:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 20:24:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-15 20:24:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 20:24:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-15 20:24:56,178 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-15 20:24:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:56,178 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-15 20:24:56,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 20:24:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-15 20:24:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 20:24:56,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:56,179 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:56,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:56,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:56,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-15 20:24:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:56,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517199888] [2023-02-15 20:24:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:56,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717860525] [2023-02-15 20:24:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:56,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:56,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 20:24:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:24:56,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 20:24:56,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:56,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 20:24:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517199888] [2023-02-15 20:24:56,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717860525] [2023-02-15 20:24:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717860525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:56,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:56,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 20:24:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178545657] [2023-02-15 20:24:56,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:56,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:24:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:24:56,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:24:56,556 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 20:24:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:56,659 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-15 20:24:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 20:24:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-15 20:24:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:56,664 INFO L225 Difference]: With dead ends: 116 [2023-02-15 20:24:56,664 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 20:24:56,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-15 20:24:56,669 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:56,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:24:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 20:24:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-15 20:24:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 20:24:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-15 20:24:56,702 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-15 20:24:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:56,702 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-15 20:24:56,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 20:24:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-15 20:24:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 20:24:56,708 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:56,708 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:56,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:56,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-15 20:24:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:56,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193466071] [2023-02-15 20:24:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:56,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:56,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790341180] [2023-02-15 20:24:56,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:24:56,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:56,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:56,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:56,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 20:24:57,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:24:57,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:24:57,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 20:24:57,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:24:57,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-15 20:24:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:57,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193466071] [2023-02-15 20:24:57,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:57,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790341180] [2023-02-15 20:24:57,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790341180] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:57,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:57,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-15 20:24:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579937622] [2023-02-15 20:24:57,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:57,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 20:24:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 20:24:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-15 20:24:57,342 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-15 20:24:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:57,577 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2023-02-15 20:24:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 20:24:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 109 [2023-02-15 20:24:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:57,580 INFO L225 Difference]: With dead ends: 216 [2023-02-15 20:24:57,580 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 20:24:57,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 20:24:57,583 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:57,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 266 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:24:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 20:24:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-02-15 20:24:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.125) internal successors, (189), 168 states have internal predecessors, (189), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 20:24:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2023-02-15 20:24:57,619 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 109 [2023-02-15 20:24:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:57,620 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2023-02-15 20:24:57,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-15 20:24:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2023-02-15 20:24:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-15 20:24:57,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:57,626 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:57,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:57,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:57,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -661676624, now seen corresponding path program 3 times [2023-02-15 20:24:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:57,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677871648] [2023-02-15 20:24:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:57,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:57,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647795594] [2023-02-15 20:24:57,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:24:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:57,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:57,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 20:24:57,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 20:24:57,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:24:57,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 20:24:57,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:24:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-02-15 20:24:58,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:24:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 96 proven. 117 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-02-15 20:24:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:24:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677871648] [2023-02-15 20:24:58,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:24:58,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647795594] [2023-02-15 20:24:58,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647795594] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:24:58,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:24:58,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-15 20:24:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521841282] [2023-02-15 20:24:58,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:24:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 20:24:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:24:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 20:24:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-15 20:24:58,373 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 20:24:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:24:58,553 INFO L93 Difference]: Finished difference Result 409 states and 448 transitions. [2023-02-15 20:24:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 20:24:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 209 [2023-02-15 20:24:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:24:58,555 INFO L225 Difference]: With dead ends: 409 [2023-02-15 20:24:58,555 INFO L226 Difference]: Without dead ends: 403 [2023-02-15 20:24:58,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 398 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-15 20:24:58,556 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:24:58,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:24:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-02-15 20:24:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2023-02-15 20:24:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 320 states have (on average 1.125) internal successors, (360), 320 states have internal predecessors, (360), 40 states have call successors, (40), 40 states have call predecessors, (40), 39 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-02-15 20:24:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 439 transitions. [2023-02-15 20:24:58,593 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 439 transitions. Word has length 209 [2023-02-15 20:24:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:24:58,594 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 439 transitions. [2023-02-15 20:24:58,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 20:24:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 439 transitions. [2023-02-15 20:24:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-15 20:24:58,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:24:58,596 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:24:58,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 20:24:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:58,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:24:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:24:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 18381746, now seen corresponding path program 1 times [2023-02-15 20:24:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:24:58,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469421818] [2023-02-15 20:24:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:24:58,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:24:58,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540147445] [2023-02-15 20:24:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:24:58,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:24:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:24:58,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:24:58,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 20:24:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 20:24:58,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 20:24:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 20:24:59,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 20:24:59,095 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 20:24:59,096 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 20:24:59,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 20:24:59,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 20:24:59,304 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-02-15 20:24:59,307 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 20:24:59,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 08:24:59 BoogieIcfgContainer [2023-02-15 20:24:59,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 20:24:59,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 20:24:59,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 20:24:59,405 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 20:24:59,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:24:52" (3/4) ... [2023-02-15 20:24:59,406 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 20:24:59,493 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 20:24:59,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 20:24:59,494 INFO L158 Benchmark]: Toolchain (without parser) took 7168.63ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 96.7MB in the beginning and 49.2MB in the end (delta: 47.5MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,494 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 107.2MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:24:59,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.80ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 86.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.88ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,494 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:24:59,495 INFO L158 Benchmark]: RCFGBuilder took 209.09ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 71.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,495 INFO L158 Benchmark]: TraceAbstraction took 6614.60ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 71.0MB in the beginning and 58.6MB in the end (delta: 12.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,495 INFO L158 Benchmark]: Witness Printer took 89.07ms. Allocated memory is still 178.3MB. Free memory was 58.6MB in the beginning and 49.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 20:24:59,497 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.14ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 107.2MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.80ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 86.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.88ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 209.09ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 71.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6614.60ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 71.0MB in the beginning and 58.6MB in the end (delta: 12.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 89.07ms. Allocated memory is still 178.3MB. Free memory was 58.6MB in the beginning and 49.2MB in the end (delta: 9.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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-38, X=40, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-38, X=40, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-38, x=0, x=0, X=40, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-38, x=0, x=0, x=0, X=40, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-38, x=0, x=0, x=0, X=40, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-36, x=0, x=0, X=40, x=0, Y=1, y=0] [L45] x++ VAL [counter=1, v=-36, X=40, x=1, x=0, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-36, x=0, x=0, x=1, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-36, x=1, x=0, x=1, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-36, x=1, x=1, X=40, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-36, x=0, X=40, x=1, x=1, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-34, x=1, X=40, x=1, x=0, y=0, Y=1] [L45] x++ VAL [counter=2, v=-34, x=1, x=2, x=0, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-34, x=0, X=40, x=2, x=1, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-34, x=0, X=40, x=2, x=2, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-34, x=0, X=40, x=2, x=2, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-34, X=40, x=2, x=0, x=2, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-32, x=0, x=2, X=40, x=2, Y=1, y=0] [L45] x++ VAL [counter=3, v=-32, x=3, x=0, X=40, x=2, y=0, Y=1] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-32, x=3, x=2, x=0, X=40, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-32, x=3, x=3, x=0, X=40, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-32, x=3, X=40, x=3, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-32, x=3, X=40, x=3, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-30, X=40, x=3, x=0, x=3, y=0, Y=1] [L45] x++ VAL [counter=4, v=-30, x=0, x=4, X=40, x=3, Y=1, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-30, x=3, x=4, X=40, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-30, X=40, x=0, x=4, x=4, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-30, x=4, x=4, X=40, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-30, x=4, x=4, X=40, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-28, X=40, x=4, x=0, x=4, Y=1, y=0] [L45] x++ VAL [counter=5, v=-28, X=40, x=4, x=0, x=5, y=0, Y=1] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-28, X=40, x=4, x=5, x=0, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-28, x=5, x=5, x=0, X=40, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-28, X=40, x=5, x=0, x=5, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-28, X=40, x=5, x=0, x=5, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-26, X=40, x=5, x=0, x=5, Y=1, y=0] [L45] x++ VAL [counter=6, v=-26, X=40, x=5, x=0, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-26, x=5, x=6, X=40, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-26, x=0, x=6, X=40, x=6, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-26, x=6, x=0, x=6, X=40, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-26, x=6, X=40, x=6, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-24, X=40, x=6, x=0, x=6, Y=1, y=0] [L45] x++ VAL [counter=7, v=-24, X=40, x=0, x=7, x=6, y=0, Y=1] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-24, X=40, x=7, x=0, x=6, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-24, X=40, x=0, x=7, x=7, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-24, X=40, x=0, x=7, x=7, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-24, X=40, x=7, x=7, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-22, x=7, X=40, x=7, x=0, y=0, Y=1] [L45] x++ VAL [counter=8, v=-22, x=0, X=40, x=8, x=7, y=0, Y=1] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-22, x=8, x=7, X=40, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-22, x=8, x=0, X=40, x=8, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-22, x=0, x=8, X=40, x=8, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-22, x=8, x=0, x=8, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-20, X=40, x=8, x=0, x=8, Y=1, y=0] [L45] x++ VAL [counter=9, v=-20, x=8, X=40, x=0, x=9, y=0, Y=1] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-20, x=8, X=40, x=0, x=9, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-20, x=9, x=9, X=40, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-20, x=0, X=40, x=9, x=9, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-20, X=40, x=9, x=0, x=9, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-18, x=9, x=0, X=40, x=9, y=0, Y=1] [L45] x++ VAL [counter=10, v=-18, x=10, X=40, x=0, x=9, Y=1, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-18, x=0, X=40, x=9, x=10, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-18, X=40, x=0, x=10, x=10, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-18, x=10, X=40, x=10, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-18, x=0, x=10, X=40, x=10, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-16, x=0, X=40, x=10, x=10, y=0, Y=1] [L45] x++ VAL [counter=11, v=-16, x=11, X=40, x=0, x=10, Y=1, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-16, x=0, X=40, x=10, x=11, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-16, x=11, x=11, X=40, x=0, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-16, x=11, x=11, X=40, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-16, X=40, x=11, x=0, x=11, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-14, x=11, X=40, x=0, x=11, Y=1, y=0] [L45] x++ VAL [counter=12, v=-14, x=11, x=12, X=40, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-14, X=40, x=11, x=0, x=12, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-14, X=40, x=0, x=12, x=12, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-14, x=12, x=0, X=40, x=12, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-14, X=40, x=0, x=12, x=12, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-12, x=12, x=12, x=0, X=40, y=0, Y=1] [L45] x++ VAL [counter=13, v=-12, X=40, x=0, x=12, x=13, y=0, Y=1] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-12, x=13, X=40, x=0, x=12, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-12, x=13, x=13, X=40, x=0, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-12, x=13, x=0, x=13, X=40, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-12, x=13, x=0, X=40, x=13, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-10, x=13, x=0, x=13, X=40, Y=1, y=0] [L45] x++ VAL [counter=14, v=-10, x=13, x=14, X=40, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-10, x=14, X=40, x=13, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-10, x=0, x=14, X=40, x=14, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-10, x=0, X=40, x=14, x=14, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-10, x=14, X=40, x=14, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-8, x=0, x=14, X=40, x=14, Y=1, y=0] [L45] x++ VAL [counter=15, v=-8, x=0, x=15, x=14, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-8, x=0, x=14, X=40, x=15, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-8, x=0, x=15, X=40, x=15, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-8, x=0, X=40, x=15, x=15, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-8, x=0, x=15, x=15, X=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-6, X=40, x=0, x=15, x=15, Y=1, y=0] [L45] x++ VAL [counter=16, v=-6, x=15, X=40, x=0, x=16, Y=1, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-6, X=40, x=16, x=15, x=0, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-6, x=16, X=40, x=16, x=0, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-6, x=0, x=16, X=40, x=16, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-6, x=16, x=16, X=40, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-4, x=0, x=16, x=16, X=40, y=0, Y=1] [L45] x++ VAL [counter=17, v=-4, x=17, x=16, X=40, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-4, x=0, X=40, x=16, x=17, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-4, x=17, x=0, X=40, x=17, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-4, x=17, x=17, X=40, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-4, x=17, x=0, X=40, x=17, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-2, x=0, x=17, X=40, x=17, Y=1, y=0] [L45] x++ VAL [counter=18, v=-2, x=0, x=18, X=40, x=17, y=0, Y=1] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-2, x=0, X=40, x=18, x=17, Y=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-2, x=18, x=0, X=40, x=18, Y=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-2, x=18, x=18, X=40, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-2, x=0, X=40, x=18, x=18, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=0, x=0, x=18, X=40, x=18, y=0, Y=1] [L45] x++ VAL [counter=19, v=0, x=0, x=19, x=18, X=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=0, x=0, x=18, x=19, X=40, y=0, Y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=0, x=0, x=19, X=40, x=19, y=0, Y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=0, x=19, X=40, x=19, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=0, x=19, x=0, X=40, x=19, Y=1, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=20, v=-78, x=19, x=0, x=19, X=40, Y=1, y=1] [L45] x++ VAL [counter=20, v=-78, x=0, X=40, x=20, x=19, Y=1, y=1] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-78, X=40, x=19, x=20, x=0, Y=1, y=1] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=21, v=-78, x=20, x=20, X=40, x=20, Y=1, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 806 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 683 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 123 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 752 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=7, InterpolantAutomatonStates: 131, 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, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 646 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 853 ConstructedInterpolants, 1 QuantifiedInterpolants, 2905 SizeOfPredicates, 41 NumberOfNonLiveVariables, 835 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 4128/5134 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! [2023-02-15 20:24:59,521 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