./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/cohencu-ll_valuebound1.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 1009b309b84d3a678e4f12db10e873a2b96e065352111c00074b04d416cca18d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:19:06,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:19:06,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:19:06,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:19:06,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:19:06,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:19:06,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:19:06,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:19:06,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:19:06,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:19:06,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:19:06,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:19:06,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:19:06,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:19:06,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:19:06,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:19:06,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:19:06,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:19:06,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:19:06,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:19:06,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:19:06,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:19:06,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:19:06,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:19:06,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:19:06,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:19:06,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:19:06,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:19:06,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:19:06,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:19:06,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:19:06,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:19:06,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:19:06,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:19:06,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:19:06,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:19:06,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:19:06,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:19:06,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:19:06,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:19:06,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:19:06,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:19:07,001 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:19:07,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:19:07,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:19:07,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:19:07,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:19:07,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:19:07,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:19:07,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:19:07,003 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:19:07,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:19:07,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:19:07,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:19:07,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:19:07,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:19:07,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:19:07,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:19:07,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:19:07,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:19:07,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:19:07,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:19:07,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:19:07,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:19:07,008 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:19:07,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:19:07,008 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:19:07,008 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 -> 1009b309b84d3a678e4f12db10e873a2b96e065352111c00074b04d416cca18d [2023-02-18 01:19:07,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:19:07,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:19:07,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:19:07,257 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:19:07,257 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:19:07,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c [2023-02-18 01:19:08,184 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:19:08,349 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:19:08,357 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c [2023-02-18 01:19:08,361 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2786275/a65e8d2b29fa43d1a68243990a7146a7/FLAG536e77402 [2023-02-18 01:19:08,374 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2786275/a65e8d2b29fa43d1a68243990a7146a7 [2023-02-18 01:19:08,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:19:08,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:19:08,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:19:08,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:19:08,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:19:08,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9989c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08, skipping insertion in model container [2023-02-18 01:19:08,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:19:08,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:19:08,585 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/cohencu-ll_valuebound1.c[588,601] [2023-02-18 01:19:08,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:19:08,614 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:19:08,622 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/cohencu-ll_valuebound1.c[588,601] [2023-02-18 01:19:08,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:19:08,636 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:19:08,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08 WrapperNode [2023-02-18 01:19:08,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:19:08,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:19:08,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:19:08,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:19:08,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,656 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-18 01:19:08,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:19:08,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:19:08,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:19:08,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:19:08,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:19:08,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:19:08,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:19:08,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:19:08,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (1/1) ... [2023-02-18 01:19:08,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:19:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:08,697 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-18 01:19:08,748 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-18 01:19:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:19:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:19:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:19:08,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:19:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:19:08,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:19:08,795 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:19:08,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:19:08,994 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:19:08,998 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:19:09,002 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:19:09,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:19:09 BoogieIcfgContainer [2023-02-18 01:19:09,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:19:09,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:19:09,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:19:09,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:19:09,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:19:08" (1/3) ... [2023-02-18 01:19:09,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c09d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:19:09, skipping insertion in model container [2023-02-18 01:19:09,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:19:08" (2/3) ... [2023-02-18 01:19:09,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c09d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:19:09, skipping insertion in model container [2023-02-18 01:19:09,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:19:09" (3/3) ... [2023-02-18 01:19:09,023 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound1.c [2023-02-18 01:19:09,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:19:09,034 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:19:09,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:19:09,090 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;@afc630e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:19:09,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:19:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:19:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:19:09,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:09,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:09,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-18 01:19:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419857667] [2023-02-18 01:19:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:09,188 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-18 01:19:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419857667] [2023-02-18 01:19:09,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419857667] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:19:09,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:19:09,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:19:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360182577] [2023-02-18 01:19:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:19:09,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:19:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:19:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:19:09,211 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 01:19:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:09,225 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-18 01:19:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:19:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2023-02-18 01:19:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:09,230 INFO L225 Difference]: With dead ends: 51 [2023-02-18 01:19:09,230 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 01:19:09,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:19:09,234 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:09,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:19:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 01:19:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 01:19:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:19:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-18 01:19:09,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-18 01:19:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:09,257 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-18 01:19:09,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 01:19:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-18 01:19:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:19:09,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:09,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:09,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 01:19:09,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-18 01:19:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418914156] [2023-02-18 01:19:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:09,424 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-18 01:19:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:09,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418914156] [2023-02-18 01:19:09,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418914156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:19:09,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:19:09,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:19:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984845084] [2023-02-18 01:19:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:19:09,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:19:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:19:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:19:09,426 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-18 01:19:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:09,486 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-18 01:19:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:19:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-02-18 01:19:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:09,487 INFO L225 Difference]: With dead ends: 29 [2023-02-18 01:19:09,487 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 01:19:09,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:19:09,488 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:09,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:19:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 01:19:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 01:19:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:19:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-18 01:19:09,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-18 01:19:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:09,498 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-18 01:19:09,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-18 01:19:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-18 01:19:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 01:19:09,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:09,499 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:09,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 01:19:09,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-18 01:19:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:09,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039436816] [2023-02-18 01:19:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:09,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:09,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612755340] [2023-02-18 01:19:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:09,513 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-18 01:19:09,547 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-18 01:19:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:19:09,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:19:09,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:19:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:09,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039436816] [2023-02-18 01:19:09,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:09,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612755340] [2023-02-18 01:19:09,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612755340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:09,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:09,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:19:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725068787] [2023-02-18 01:19:09,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:09,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:19:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:19:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:19:09,733 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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-18 01:19:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:10,155 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-18 01:19:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:19:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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 14 [2023-02-18 01:19:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:10,159 INFO L225 Difference]: With dead ends: 52 [2023-02-18 01:19:10,159 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 01:19:10,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:10,160 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:10,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 01:19:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 01:19:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-18 01:19:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:19:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-18 01:19:10,202 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-18 01:19:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:10,202 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-18 01:19:10,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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-18 01:19:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-18 01:19:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:19:10,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:10,203 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:10,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:19:10,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:10,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-18 01:19:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:10,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343235584] [2023-02-18 01:19:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:10,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516675522] [2023-02-18 01:19:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:10,427 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-18 01:19:10,437 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-18 01:19:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:10,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:19:10,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:19:10,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:19:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343235584] [2023-02-18 01:19:10,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516675522] [2023-02-18 01:19:10,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516675522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:10,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:10,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:19:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920415917] [2023-02-18 01:19:10,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:10,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:19:10,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:19:10,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:19:10,587 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:19:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:10,770 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-18 01:19:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:19:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 01:19:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:10,773 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:19:10,773 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 01:19:10,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:10,777 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:10,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:19:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 01:19:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 01:19:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:19:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-18 01:19:10,793 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-18 01:19:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:10,793 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-18 01:19:10,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:19:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-18 01:19:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 01:19:10,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:10,794 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:10,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 01:19:10,999 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,SelfDestructingSolverStorable3 [2023-02-18 01:19:10,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-18 01:19:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:11,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426753837] [2023-02-18 01:19:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:11,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:11,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521948416] [2023-02-18 01:19:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:11,011 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-18 01:19:11,013 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-18 01:19:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:11,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 01:19:11,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:19:11,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:19:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:11,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426753837] [2023-02-18 01:19:11,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521948416] [2023-02-18 01:19:11,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521948416] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:11,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:11,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:19:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973265262] [2023-02-18 01:19:11,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:11,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:19:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:19:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:19:11,154 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:19:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:12,114 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-18 01:19:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:19:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-02-18 01:19:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:12,116 INFO L225 Difference]: With dead ends: 67 [2023-02-18 01:19:12,116 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 01:19:12,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:12,117 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:12,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 01:19:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 01:19:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 01:19:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 01:19:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-18 01:19:12,132 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-18 01:19:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:12,132 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-18 01:19:12,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:19:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-18 01:19:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 01:19:12,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:12,134 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:12,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 01:19:12,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:12,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-18 01:19:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:12,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491267986] [2023-02-18 01:19:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:12,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:12,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438691641] [2023-02-18 01:19:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:12,361 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-18 01:19:12,362 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-18 01:19:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:19:12,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:19:12,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:19:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491267986] [2023-02-18 01:19:12,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438691641] [2023-02-18 01:19:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438691641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:12,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 01:19:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744659395] [2023-02-18 01:19:12,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:12,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:19:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:19:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:12,566 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:19:15,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:19:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:15,505 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-18 01:19:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:19:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-18 01:19:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:15,507 INFO L225 Difference]: With dead ends: 82 [2023-02-18 01:19:15,507 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 01:19:15,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:19:15,508 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:15,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-02-18 01:19:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 01:19:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 01:19:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:19:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-18 01:19:15,524 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-18 01:19:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:15,524 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-18 01:19:15,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:19:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-18 01:19:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 01:19:15,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:15,525 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:15,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 01:19:15,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:15,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-18 01:19:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:15,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260326926] [2023-02-18 01:19:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:15,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:15,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780595018] [2023-02-18 01:19:15,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:19:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:15,749 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-18 01:19:15,751 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-18 01:19:15,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:19:15,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:19:15,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:19:15,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 01:19:15,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 01:19:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260326926] [2023-02-18 01:19:15,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780595018] [2023-02-18 01:19:15,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780595018] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:15,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:15,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:19:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121272652] [2023-02-18 01:19:15,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:15,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:19:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:19:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:19:15,877 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:19:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:16,294 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-18 01:19:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:19:16,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-18 01:19:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:16,295 INFO L225 Difference]: With dead ends: 86 [2023-02-18 01:19:16,295 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 01:19:16,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:16,296 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:16,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 01:19:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 01:19:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 01:19:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:19:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-18 01:19:16,310 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-18 01:19:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:16,310 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-18 01:19:16,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:19:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-18 01:19:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 01:19:16,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:16,312 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:16,352 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-18 01:19:16,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:16,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-18 01:19:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458570863] [2023-02-18 01:19:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:16,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:16,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113118746] [2023-02-18 01:19:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:16,526 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-18 01:19:16,530 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-18 01:19:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 01:19:16,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:19:16,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:19:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:16,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458570863] [2023-02-18 01:19:16,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:16,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113118746] [2023-02-18 01:19:16,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113118746] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:16,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:16,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 01:19:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748049992] [2023-02-18 01:19:16,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:16,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:19:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:19:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:16,744 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:19:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:17,114 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-18 01:19:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:19:17,116 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-18 01:19:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:17,117 INFO L225 Difference]: With dead ends: 95 [2023-02-18 01:19:17,117 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 01:19:17,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:19:17,118 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:17,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:19:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 01:19:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-18 01:19:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 01:19:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-18 01:19:17,139 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-18 01:19:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:17,139 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-18 01:19:17,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:19:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-18 01:19:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 01:19:17,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:17,142 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:17,148 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-18 01:19:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:17,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-18 01:19:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228783061] [2023-02-18 01:19:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:17,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:17,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2761832] [2023-02-18 01:19:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:17,369 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-18 01:19:17,370 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-18 01:19:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:19:17,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 01:19:17,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 01:19:17,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228783061] [2023-02-18 01:19:17,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2761832] [2023-02-18 01:19:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2761832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:19:17,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:19:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 01:19:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693114774] [2023-02-18 01:19:17,560 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:17,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 01:19:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 01:19:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:19:17,561 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:19:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:17,697 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-18 01:19:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:19:17,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-18 01:19:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:17,699 INFO L225 Difference]: With dead ends: 97 [2023-02-18 01:19:17,699 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 01:19:17,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:19:17,700 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:17,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:19:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 01:19:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 01:19:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:19:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-18 01:19:17,722 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-18 01:19:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:17,723 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-18 01:19:17,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:19:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-18 01:19:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 01:19:17,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:17,724 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:17,743 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-18 01:19:17,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:17,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-18 01:19:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:17,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056469948] [2023-02-18 01:19:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:17,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484321833] [2023-02-18 01:19:17,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:19:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:17,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:17,957 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-18 01:19:17,961 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-18 01:19:17,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 01:19:17,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:19:17,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 01:19:17,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:19:18,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:19:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056469948] [2023-02-18 01:19:18,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484321833] [2023-02-18 01:19:18,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484321833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:19:18,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:19:18,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 01:19:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843234111] [2023-02-18 01:19:18,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:18,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:19:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:19:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:19:18,155 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:19:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:18,869 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-18 01:19:18,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:19:18,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-02-18 01:19:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:18,871 INFO L225 Difference]: With dead ends: 110 [2023-02-18 01:19:18,871 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 01:19:18,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:19:18,871 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:18,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 01:19:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 01:19:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-18 01:19:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:19:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-18 01:19:18,890 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-18 01:19:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:18,890 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-18 01:19:18,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:19:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-18 01:19:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 01:19:18,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:18,892 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:18,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:19:19,096 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,SelfDestructingSolverStorable9 [2023-02-18 01:19:19,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-18 01:19:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:19,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935292107] [2023-02-18 01:19:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:19,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:19,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:19,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059818512] [2023-02-18 01:19:19,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:19:19,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:19,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:19,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:19:19,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:19:19,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:19:19,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:19:19,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 01:19:19,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 01:19:19,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:19:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:19,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935292107] [2023-02-18 01:19:19,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:19,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059818512] [2023-02-18 01:19:19,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059818512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:19:19,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:19:19,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:19:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819849450] [2023-02-18 01:19:19,453 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:19:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:19:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:19:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:19:19,454 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:19:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:19,723 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2023-02-18 01:19:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:19:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-18 01:19:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:19,724 INFO L225 Difference]: With dead ends: 115 [2023-02-18 01:19:19,724 INFO L226 Difference]: Without dead ends: 102 [2023-02-18 01:19:19,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:19:19,725 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:19,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:19:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-18 01:19:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-02-18 01:19:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:19:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-02-18 01:19:19,747 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 99 [2023-02-18 01:19:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:19,748 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-02-18 01:19:19,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:19:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-02-18 01:19:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 01:19:19,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:19:19,749 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:19:19,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 01:19:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:19,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:19:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:19:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-18 01:19:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:19:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726871273] [2023-02-18 01:19:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:19:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:19:19,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:19:19,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012441547] [2023-02-18 01:19:19,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:19:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:19:19,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:19:19,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:19:19,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 01:19:20,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:19:20,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:19:20,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 01:19:20,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:19:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2023-02-18 01:19:20,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:19:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:19:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726871273] [2023-02-18 01:19:20,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:19:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012441547] [2023-02-18 01:19:20,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012441547] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:19:20,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:19:20,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 01:19:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184776846] [2023-02-18 01:19:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:19:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 01:19:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:19:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 01:19:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 01:19:20,051 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-02-18 01:19:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:19:20,132 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2023-02-18 01:19:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:19:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 121 [2023-02-18 01:19:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:19:20,133 INFO L225 Difference]: With dead ends: 106 [2023-02-18 01:19:20,133 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:19:20,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:19:20,134 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:19:20,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:19:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:19:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:19:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:19:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:19:20,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-02-18 01:19:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:19:20,135 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:19:20,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-02-18 01:19:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:19:20,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:19:20,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:19:20,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-18 01:19:20,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 01:19:20,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:19:20,361 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:19:20,361 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse25 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse16 (not .cse25)) (.cse19 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse5 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse1 (or .cse25 (let ((.cse27 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse26 (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse16 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse26) (or (not .cse26) (not (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse19)) .cse5))))) (.cse20 (+ 0 1)) (.cse21 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse9 (+ 6 1)) (.cse18 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse10 (+ 6 6)) (.cse14 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse13 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse0) (not .cse3))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3))) (.cse17 (= .cse21 (* .cse22 (* .cse22 .cse22)))) (.cse4 (<= |ULTIMATE.start_main_~n~0#1| .cse20)) (.cse15 (let ((.cse23 (= (+ (let ((.cse24 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse24 (* .cse24 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse1 .cse23) (and .cse1 (or .cse16 .cse23))))) (.cse12 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)))) (or (and .cse0 .cse1 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse8 (+ (* (- 1) .cse19) |ULTIMATE.start_main_~y~0#1|)) (.cse11 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse8 .cse9) .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ .cse8 1)) (= .cse10 .cse11) (<= 1 .cse12) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse13) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse14) .cse2 (= (+ 6 .cse11) |ULTIMATE.start_main_~z~0#1|) .cse3 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse15 (or .cse16 .cse17) (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse18 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse10 .cse19) (<= .cse12 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse12)))) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse12 0) (= |ULTIMATE.start_main_~x~0#1| .cse20) (= |ULTIMATE.start_main_~n~0#1| .cse20) (= |ULTIMATE.start_main_~y~0#1| .cse9) .cse0 (= (+ (- 6) (+ (+ .cse18 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0) (= .cse10 |ULTIMATE.start_main_~z~0#1|) (or (not .cse14) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse21)) (* .cse21 .cse13)) (* .cse21 12)) 0) (< .cse22 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse19 1)) .cse2 .cse17 .cse3 .cse4 .cse15 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse12) .cse6 .cse7 (= .cse19 6))))))) [2023-02-18 01:19:20,362 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse9 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse19 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse15 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse14 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse3 (= (+ (- 6) (+ (+ .cse14 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse4 (let ((.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse23 (let ((.cse25 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse24 (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse23) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse24) (or (not .cse24) (not (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse15)) .cse17)))))) (.cse5 (= (+ (let ((.cse22 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse22 (* .cse22 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (or .cse9 (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse20)) (* .cse20 .cse1)) (* .cse20 12)) 0) (< .cse21 .cse19))) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse2) (not .cse12))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2 .cse12))) (.cse11 (= .cse20 (* .cse21 (* .cse21 .cse21)))) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse0 (+ (* (- 1) .cse15) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (+ 6 6)) (.cse16 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (and (= .cse0 (+ 6 1)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse1) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 1)) (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (= (+ 6 .cse7) |ULTIMATE.start_main_~z~0#1|) .cse12 .cse13 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse14 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse6 .cse15) (<= .cse16 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse16)))) (and .cse4 (= |ULTIMATE.start_main_~y~0#1| 1) .cse17 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse18 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse18) (= |ULTIMATE.start_main_~n~0#1| .cse18) .cse2 .cse3 .cse4 .cse5 .cse8 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse15 1)) .cse10 .cse11 (<= .cse19 1) .cse12 (<= |ULTIMATE.start_main_~n~0#1| .cse18) .cse13 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse15 6)))))) [2023-02-18 01:19:20,362 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= 6 |ULTIMATE.start_main_~z~0#1|)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse8 (let ((.cse10 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse9 (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse8) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse9) (or (not .cse9) (not (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) .cse2))))))) (or (and .cse6 (= (+ (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse7 (* .cse7 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse6 .cse1 .cse2 .cse4))))) (or (and (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse5) (and .cse2 .cse3 .cse5 .cse4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ (- 6) (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 12)) (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0))))) [2023-02-18 01:19:20,362 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse13 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse12 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse2 (= (+ (- 6) (+ (+ .cse12 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse4 (= (+ (let ((.cse21 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse21 (* .cse21 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (= .cse13 (* .cse14 (* .cse14 .cse14)))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse3 (let ((.cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse18 (let ((.cse20 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse19 (<= (+ .cse20 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse18) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse19) (or (not .cse19) (not (<= (+ .cse20 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse15)) .cse17))))))) (or (let ((.cse1 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse8 (>= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse0 (+ (* (- 1) .cse15) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse1) (not .cse8))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1 .cse8)))) (and (= .cse0 (+ 6 1)) .cse1 (let ((.cse11 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse5 (or (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse13)) (* .cse13 .cse11)) (* .cse13 12)) 0) (< .cse14 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse10 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse11) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 1)) .cse6 .cse8 (= (+ 6 6) .cse15) (= 0 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~n~0#1|)))))) (let ((.cse16 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse16) (= |ULTIMATE.start_main_~n~0#1| .cse16) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~y~0#1| (+ .cse15 1)) .cse7 .cse9 (= .cse15 6))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse17 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))))) [2023-02-18 01:19:20,363 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse9 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse19 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse15 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse14 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse3 (= (+ (- 6) (+ (+ .cse14 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse4 (let ((.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse23 (let ((.cse25 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse24 (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse23) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse24) (or (not .cse24) (not (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse15)) .cse17)))))) (.cse5 (= (+ (let ((.cse22 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse22 (* .cse22 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (or .cse9 (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse20)) (* .cse20 .cse1)) (* .cse20 12)) 0) (< .cse21 .cse19))) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse2) (not .cse12))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2 .cse12))) (.cse11 (= .cse20 (* .cse21 (* .cse21 .cse21)))) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse0 (+ (* (- 1) .cse15) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (+ 6 6)) (.cse16 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (and (= .cse0 (+ 6 1)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse1) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 1)) (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (= (+ 6 .cse7) |ULTIMATE.start_main_~z~0#1|) .cse12 .cse13 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse14 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse6 .cse15) (<= .cse16 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse16)))) (and .cse4 (= |ULTIMATE.start_main_~y~0#1| 1) .cse17 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse18 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse18) (= |ULTIMATE.start_main_~n~0#1| .cse18) .cse2 .cse3 .cse4 .cse5 .cse8 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse15 1)) .cse10 .cse11 (<= .cse19 1) .cse12 (<= |ULTIMATE.start_main_~n~0#1| .cse18) .cse13 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse15 6)))))) [2023-02-18 01:19:20,363 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 01:19:20,363 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:19:20,363 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-18 01:19:20,363 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-18 01:19:20,363 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse9 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse11 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse15 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse20 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse1 (+ 0 1))) (let ((.cse16 (<= |ULTIMATE.start_main_~n~0#1| .cse1)) (.cse18 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse2 (+ 6 1)) (.cse5 (let ((.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse24 (let ((.cse26 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse25 (<= (+ .cse26 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse24) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse25) (or (not .cse25) (not (<= (+ .cse26 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse12)) .cse20)))))) (.cse6 (= (+ (let ((.cse23 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse23 (* .cse23 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse10 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse13 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse3) (not .cse15))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3 .cse15))) (.cse14 (= .cse9 (* .cse11 (* .cse11 .cse11)))) (.cse17 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse4 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse7 (+ 6 6)) (.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse1) (= |ULTIMATE.start_main_~n~0#1| .cse1) (= |ULTIMATE.start_main_~y~0#1| .cse2) .cse3 (= (+ (- 6) (+ (+ .cse4 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0) .cse5 .cse6 (= .cse7 |ULTIMATE.start_main_~z~0#1|) (or (not .cse8) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse9)) (* .cse9 .cse10)) (* .cse9 12)) 0) (< .cse11 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse12 1)) .cse13 .cse14 .cse15 .cse16 .cse17 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse0) .cse18 .cse19 (= .cse12 6)) (and .cse3 .cse5 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse13 (= |ULTIMATE.start_main_~y~0#1| 1) .cse15 .cse16 .cse20 .cse18 .cse19 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse21 (+ (* (- 1) .cse12) |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse21 .cse2) .cse3 .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ .cse21 1)) (= .cse7 .cse22) (<= 1 .cse0) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse10) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse8) .cse13 .cse14 (= (+ 6 .cse22) |ULTIMATE.start_main_~z~0#1|) .cse15 .cse17 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse4 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse7 .cse12) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse0))))))) [2023-02-18 01:19:20,364 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse25 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse16 (not .cse25)) (.cse19 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse5 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse1 (or .cse25 (let ((.cse27 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse26 (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse16 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse26) (or (not .cse26) (not (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse19)) .cse5))))) (.cse20 (+ 0 1)) (.cse21 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse9 (+ 6 1)) (.cse18 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse10 (+ 6 6)) (.cse14 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse13 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse0) (not .cse3))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3))) (.cse17 (= .cse21 (* .cse22 (* .cse22 .cse22)))) (.cse4 (<= |ULTIMATE.start_main_~n~0#1| .cse20)) (.cse15 (let ((.cse23 (= (+ (let ((.cse24 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse24 (* .cse24 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse1 .cse23) (and .cse1 (or .cse16 .cse23))))) (.cse12 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)))) (or (and .cse0 .cse1 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse8 (+ (* (- 1) .cse19) |ULTIMATE.start_main_~y~0#1|)) (.cse11 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse8 .cse9) .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ .cse8 1)) (= .cse10 .cse11) (<= 1 .cse12) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse13) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse14) .cse2 (= (+ 6 .cse11) |ULTIMATE.start_main_~z~0#1|) .cse3 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse15 (or .cse16 .cse17) (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse18 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse10 .cse19) (<= .cse12 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse12)))) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse12 0) (= |ULTIMATE.start_main_~x~0#1| .cse20) (= |ULTIMATE.start_main_~n~0#1| .cse20) (= |ULTIMATE.start_main_~y~0#1| .cse9) .cse0 (= (+ (- 6) (+ (+ .cse18 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0) (= .cse10 |ULTIMATE.start_main_~z~0#1|) (or (not .cse14) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse21)) (* .cse21 .cse13)) (* .cse21 12)) 0) (< .cse22 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse19 1)) .cse2 .cse17 .cse3 .cse4 .cse15 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse12) .cse6 .cse7 (= .cse19 6))))))) [2023-02-18 01:19:20,364 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse5 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse9 (+ 0 1))) (let ((.cse4 (<= |ULTIMATE.start_main_~n~0#1| .cse9)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse10 (+ 6 1)) (.cse1 (let ((.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse23 (let ((.cse25 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse24 (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse23) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse24) (or (not .cse24) (not (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse5)))))) (.cse12 (= (+ (let ((.cse22 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse22 (* .cse22 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse16 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse14 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse0) (not .cse3))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3))) (.cse19 (= .cse15 (* .cse17 (* .cse17 .cse17)))) (.cse11 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse13 (+ 6 6)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 .cse1 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse8 0) (= |ULTIMATE.start_main_~x~0#1| .cse9) (= |ULTIMATE.start_main_~n~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse0 (= (+ (- 6) (+ (+ .cse11 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0) .cse1 .cse12 (= .cse13 |ULTIMATE.start_main_~z~0#1|) (or (not .cse14) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse15)) (* .cse15 .cse16)) (* .cse15 12)) 0) (< .cse17 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse2 .cse19 .cse3 .cse4 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse8) .cse6 .cse7 (= .cse18 6)) (let ((.cse20 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse20 .cse10) .cse0 .cse1 .cse12 (= |ULTIMATE.start_main_~x~0#1| (+ .cse20 1)) (= .cse13 .cse21) (<= 1 .cse8) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse14) .cse2 .cse19 (= (+ 6 .cse21) |ULTIMATE.start_main_~z~0#1|) .cse3 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse11 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse13 .cse18) (<= .cse8 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse8))))))) [2023-02-18 01:19:20,364 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:19:20,364 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:19:20,364 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 01:19:20,365 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse12 (let ((.cse14 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse13 (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse13) (or (not .cse13) (not (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse3)))))) (.cse1 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse0 (let ((.cse6 (= (+ (- 6) (+ (+ .cse1 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse7 (= (+ (let ((.cse11 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse11 (* .cse11 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ |ULTIMATE.start_main_~n~0#1| 1))) (* .cse10 (* .cse10 .cse10))))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse5 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse5) (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse6 .cse2 .cse7 .cse8 .cse9)) (and .cse6 .cse2 .cse7 .cse8 .cse9))))) (or (and .cse0 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse1 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) (= .cse4 6)))))) [2023-02-18 01:19:20,365 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse15 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse21 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse10 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse7 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse16 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse4 (= (+ (- 6) (+ (+ .cse16 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse0 (let ((.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse24 (let ((.cse26 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse25 (<= (+ .cse26 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse24) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse25) (or (not .cse25) (not (<= (+ .cse26 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse7)) .cse1)))))) (.cse5 (= (+ (let ((.cse23 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse23 (* .cse23 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (or .cse19 (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse21)) (* .cse21 .cse15)) (* .cse21 12)) 0) (< .cse22 .cse10))) (.cse9 (= .cse21 (* .cse22 (* .cse22 .cse22)))) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse3) (not .cse11))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3 .cse11)))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse2 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse2) (= |ULTIMATE.start_main_~n~0#1| .cse2) .cse3 .cse4 .cse0 .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse7 1)) .cse8 .cse9 (<= .cse10 1) .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse2) .cse12 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse7 6))) (let ((.cse13 (+ (* (- 1) .cse7) |ULTIMATE.start_main_~y~0#1|)) (.cse18 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ 6 6)) (.cse20 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (and (= .cse13 (+ 6 1)) .cse3 (let ((.cse14 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse16 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse3 .cse4 .cse0 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14) (and (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse3 .cse4 .cse0 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse13 1)) (= .cse17 .cse18) .cse19 .cse8 (= (+ 6 .cse18) |ULTIMATE.start_main_~z~0#1|) .cse11 (= .cse17 .cse7) (<= .cse20 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse20))))))) [2023-02-18 01:19:20,365 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 01:19:20,365 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse9 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse11 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse15 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse20 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse23 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse1 (+ 0 1))) (let ((.cse16 (<= |ULTIMATE.start_main_~n~0#1| .cse1)) (.cse18 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse2 (+ 6 1)) (.cse4 (= (+ (- 6) (+ (+ .cse23 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse5 (let ((.cse25 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse25 (let ((.cse27 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse26 (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse25) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse26) (or (not .cse26) (not (<= (+ .cse27 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse12)) .cse20)))))) (.cse6 (= (+ (let ((.cse24 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse24 (* .cse24 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse10 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse13 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse3) (not .cse15))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3 .cse15))) (.cse14 (= .cse9 (* .cse11 (* .cse11 .cse11)))) (.cse17 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse7 (+ 6 6)) (.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse1) (= |ULTIMATE.start_main_~n~0#1| .cse1) (= |ULTIMATE.start_main_~y~0#1| .cse2) .cse3 .cse4 .cse5 .cse6 (= .cse7 |ULTIMATE.start_main_~z~0#1|) (or (not .cse8) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse9)) (* .cse9 .cse10)) (* .cse9 12)) 0) (< .cse11 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse12 1)) .cse13 .cse14 .cse15 .cse16 .cse17 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse0) .cse18 .cse19 (= .cse12 6)) (and .cse3 .cse5 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse13 (= |ULTIMATE.start_main_~y~0#1| 1) .cse15 .cse16 .cse20 .cse18 .cse19 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse21 (+ (* (- 1) .cse12) |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse21 .cse2) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ .cse21 1)) (= .cse7 .cse22) (<= 1 .cse0) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse10) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse8) .cse13 .cse14 (= (+ 6 .cse22) |ULTIMATE.start_main_~z~0#1|) .cse15 .cse17 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse23 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse7 .cse12) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse0))))))) [2023-02-18 01:19:20,366 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse5 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse9 (+ 0 1))) (let ((.cse4 (<= |ULTIMATE.start_main_~n~0#1| .cse9)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse10 (+ 6 1)) (.cse1 (let ((.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse23 (let ((.cse25 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse24 (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse23) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse24) (or (not .cse24) (not (<= (+ .cse25 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse5)))))) (.cse12 (= (+ (let ((.cse22 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse22 (* .cse22 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse16 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse14 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse0) (not .cse3))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3))) (.cse19 (= .cse15 (* .cse17 (* .cse17 .cse17)))) (.cse11 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse13 (+ 6 6)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 .cse1 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse8 0) (= |ULTIMATE.start_main_~x~0#1| .cse9) (= |ULTIMATE.start_main_~n~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse0 (= (+ (- 6) (+ (+ .cse11 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0) .cse1 .cse12 (= .cse13 |ULTIMATE.start_main_~z~0#1|) (or (not .cse14) (= (+ (+ (- (* (+ 6 |ULTIMATE.start_main_~z~0#1|) .cse15)) (* .cse15 .cse16)) (* .cse15 12)) 0) (< .cse17 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse2 .cse19 .cse3 .cse4 (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|) 0) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse8) .cse6 .cse7 (= .cse18 6)) (let ((.cse20 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse20 .cse10) .cse0 .cse1 .cse12 (= |ULTIMATE.start_main_~x~0#1| (+ .cse20 1)) (= .cse13 .cse21) (<= 1 .cse8) (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse14) .cse2 .cse19 (= (+ 6 .cse21) |ULTIMATE.start_main_~z~0#1|) .cse3 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse11 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) (= .cse13 .cse18) (<= .cse8 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (- 1) .cse8))))))) [2023-02-18 01:19:20,366 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 01:19:20,366 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 01:19:20,366 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:19:20,366 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:19:20,366 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 01:19:20,366 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 01:19:20,368 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 01:19:20,370 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:19:20,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:19:20 BoogieIcfgContainer [2023-02-18 01:19:20,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:19:20,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:19:20,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:19:20,390 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:19:20,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:19:09" (3/4) ... [2023-02-18 01:19:20,392 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:19:20,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:19:20,406 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 01:19:20,407 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:19:20,407 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:19:20,407 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:19:20,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:19:20,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:19:20,453 INFO L158 Benchmark]: Toolchain (without parser) took 12073.70ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 121.4MB in the beginning and 65.1MB in the end (delta: 56.3MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,453 INFO L158 Benchmark]: CDTParser took 3.12ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 98.7MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:19:20,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.59ms. Allocated memory is still 153.1MB. Free memory was 121.4MB in the beginning and 110.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.07ms. Allocated memory is still 153.1MB. Free memory was 110.3MB in the beginning and 108.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,454 INFO L158 Benchmark]: Boogie Preprocessor took 11.99ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 107.9MB in the end (delta: 930.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:19:20,454 INFO L158 Benchmark]: RCFGBuilder took 336.57ms. Allocated memory is still 153.1MB. Free memory was 107.9MB in the beginning and 118.9MB in the end (delta: -11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,454 INFO L158 Benchmark]: TraceAbstraction took 11383.18ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 118.7MB in the beginning and 68.2MB in the end (delta: 50.5MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,454 INFO L158 Benchmark]: Witness Printer took 62.27ms. Allocated memory is still 184.5MB. Free memory was 68.2MB in the beginning and 65.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:19:20,455 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.12ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 98.7MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.59ms. Allocated memory is still 153.1MB. Free memory was 121.4MB in the beginning and 110.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.07ms. Allocated memory is still 153.1MB. Free memory was 110.3MB in the beginning and 108.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.99ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 107.9MB in the end (delta: 930.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.57ms. Allocated memory is still 153.1MB. Free memory was 107.9MB in the beginning and 118.9MB in the end (delta: -11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11383.18ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 118.7MB in the beginning and 68.2MB in the end (delta: 50.5MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 62.27ms. Allocated memory is still 184.5MB. Free memory was 68.2MB in the beginning and 65.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 917 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 582 mSDsCounter, 423 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2594 IncrementalHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 423 mSolverCounterUnsat, 335 mSDtfsCounter, 2594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1014 GetRequests, 861 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 65 PreInvPairs, 101 NumberOfFragments, 7726 HoareAnnotationTreeSize, 65 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 614 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 899 ConstructedInterpolants, 0 QuantifiedInterpolants, 5550 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1406 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 3402/3622 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((a <= 1 && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && n >= 0) && ((cond == 0 && (!(a <= 1) || !(a >= 0))) || ((cond == 1 && a <= 1) && a >= 0))) && y == 1) && a >= 0) && n <= 0 + 1) && n == 0) && 0 <= a) && z == -1 + y + 6) && x == 0) && 6 == z) || (((((((((((((((-1 * (z + -6) + y == 6 + 1 && a <= 1) && x == -1 * (z + -6) + y + 1) && 6 + 6 == -7 + y) && 1 <= -1 + n) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && ((cond == 0 && (!(a <= 1) || !(a >= 0))) || ((cond == 1 && a <= 1) && a >= 0))) && 6 + (-7 + y) == z) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && -1 + n <= a) && 0 == -1 + (-1 + n))) || (((((((((((((((((((((x + -1 * 1 == 0 && -1 + n == 0) && x == 0 + 1) && n == 0 + 1) && y == 6 + 1) && a <= 1) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && 6 + 6 == z) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && y == z + -6 + 1) && ((cond == 0 && (!(a <= 1) || !(a >= 0))) || ((cond == 1 && a <= 1) && a >= 0))) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && -1 * y + 6 + x == 0) && -1 * 6 + y == 1) && 0 <= -1 + n) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:19:20,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE