./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/dijkstra-u_unwindbound2.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 ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 06:54:52,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:54:52,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:54:52,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:54:52,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:54:52,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:54:52,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:54:52,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:54:52,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:54:52,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:54:52,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:54:52,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:54:52,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:54:52,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:54:52,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:54:52,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:54:52,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:54:52,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:54:52,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:54:52,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:54:52,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:54:52,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:54:52,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:54:52,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:54:52,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:54:52,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:54:52,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:54:52,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:54:52,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:54:52,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:54:52,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:54:52,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:54:52,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:54:52,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:54:52,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:54:52,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:54:52,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:54:52,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:54:52,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:54:52,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:54:52,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:54:52,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:54:52,924 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:54:52,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:54:52,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:54:52,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:54:52,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:54:52,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:54:52,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:54:52,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:54:52,926 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:54:52,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:54:52,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:54:52,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:54:52,928 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:54:52,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:54:52,928 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:54:52,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:54:52,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:54:52,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:54:52,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:54:52,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:54:52,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:54:52,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:54:52,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:54:52,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:54:52,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:54:52,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:54:52,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:54:52,930 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:54:52,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:54:52,931 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:54:52,931 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 -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca [2023-02-17 06:54:53,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:54:53,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:54:53,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:54:53,210 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:54:53,210 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:54:53,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2023-02-17 06:54:54,387 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:54:54,579 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:54:54,579 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2023-02-17 06:54:54,586 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045a0047/eeb44670a50449bd8731095f14aacf37/FLAG1ee421856 [2023-02-17 06:54:54,603 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045a0047/eeb44670a50449bd8731095f14aacf37 [2023-02-17 06:54:54,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:54:54,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:54:54,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:54:54,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:54:54,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:54:54,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343f69f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54, skipping insertion in model container [2023-02-17 06:54:54,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:54:54,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:54:54,790 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/dijkstra-u_unwindbound2.c[525,538] [2023-02-17 06:54:54,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:54:54,830 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:54:54,839 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/dijkstra-u_unwindbound2.c[525,538] [2023-02-17 06:54:54,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:54:54,862 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:54:54,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54 WrapperNode [2023-02-17 06:54:54,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:54:54,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:54:54,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:54:54,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:54:54,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,889 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 06:54:54,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:54:54,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:54:54,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:54:54,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:54:54,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,908 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:54:54,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:54:54,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:54:54,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:54:54,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (1/1) ... [2023-02-17 06:54:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:54:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:54:54,950 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-17 06:54:54,960 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-17 06:54:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:54:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:54:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:54:54,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:54:54,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:54:54,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:54:55,037 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:54:55,039 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:54:55,195 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:54:55,200 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:54:55,200 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 06:54:55,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:54:55 BoogieIcfgContainer [2023-02-17 06:54:55,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:54:55,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:54:55,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:54:55,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:54:55,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:54:54" (1/3) ... [2023-02-17 06:54:55,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca68761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:54:55, skipping insertion in model container [2023-02-17 06:54:55,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:54:54" (2/3) ... [2023-02-17 06:54:55,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca68761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:54:55, skipping insertion in model container [2023-02-17 06:54:55,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:54:55" (3/3) ... [2023-02-17 06:54:55,212 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2023-02-17 06:54:55,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:54:55,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:54:55,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:54:55,349 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;@53fe1f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:54:55,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:54:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 06:54:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 06:54:55,364 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:54:55,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:54:55,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:54:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:54:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2023-02-17 06:54:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:54:55,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35605553] [2023-02-17 06:54:55,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:54:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:54:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35605553] [2023-02-17 06:54:55,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 06:54:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855278993] [2023-02-17 06:54:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:55,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:54:55,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:54:55,509 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-17 06:54:55,511 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-17 06:54:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:55,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 06:54:55,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:54:55,625 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-17 06:54:55,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:54:55,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855278993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:54:55,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:54:55,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 06:54:55,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377784666] [2023-02-17 06:54:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:54:55,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 06:54:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:54:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 06:54:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:54:55,676 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-17 06:54:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:54:55,702 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2023-02-17 06:54:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 06:54:55,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2023-02-17 06:54:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:54:55,710 INFO L225 Difference]: With dead ends: 57 [2023-02-17 06:54:55,711 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 06:54:55,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-17 06:54:55,719 INFO L413 NwaCegarLoop]: 42 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, 42 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-17 06:54:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:54:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 06:54:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 06:54:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 06:54:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2023-02-17 06:54:55,761 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2023-02-17 06:54:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:54:55,762 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2023-02-17 06:54:55,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-17 06:54:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2023-02-17 06:54:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 06:54:55,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:54:55,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:54:55,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 06:54:55,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 06:54:55,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:54:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:54:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2023-02-17 06:54:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:54:55,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666747174] [2023-02-17 06:54:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:54:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:54:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666747174] [2023-02-17 06:54:56,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 06:54:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579176563] [2023-02-17 06:54:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:54:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:54:56,006 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-17 06:54:56,022 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-17 06:54:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:56,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 06:54:56,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:54:56,087 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-17 06:54:56,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:54:56,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579176563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:54:56,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:54:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 06:54:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147048225] [2023-02-17 06:54:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:54:56,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 06:54:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:54:56,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 06:54:56,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:54:56,090 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-17 06:54:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:54:56,108 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2023-02-17 06:54:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 06:54:56,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2023-02-17 06:54:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:54:56,109 INFO L225 Difference]: With dead ends: 47 [2023-02-17 06:54:56,110 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 06:54:56,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 06:54:56,111 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:54:56,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:54:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 06:54:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 06:54:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 06:54:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-02-17 06:54:56,118 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2023-02-17 06:54:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:54:56,118 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-02-17 06:54:56,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-17 06:54:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-02-17 06:54:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 06:54:56,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:54:56,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:54:56,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 06:54:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 06:54:56,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:54:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:54:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2023-02-17 06:54:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:54:56,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787736578] [2023-02-17 06:54:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:54:56,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:54:56,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837469149] [2023-02-17 06:54:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:56,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:54:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:54:56,346 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-17 06:54:56,371 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-17 06:54:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:56,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 06:54:56,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:54:56,434 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-17 06:54:56,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:54:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:54:56,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787736578] [2023-02-17 06:54:56,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:54:56,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837469149] [2023-02-17 06:54:56,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837469149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:54:56,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:54:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 06:54:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63396101] [2023-02-17 06:54:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:54:56,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:54:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:54:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:54:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:54:56,442 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-17 06:54:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:54:56,476 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-02-17 06:54:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:54:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2023-02-17 06:54:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:54:56,479 INFO L225 Difference]: With dead ends: 41 [2023-02-17 06:54:56,480 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 06:54:56,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:54:56,482 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:54:56,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:54:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 06:54:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-02-17 06:54:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 06:54:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-02-17 06:54:56,488 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2023-02-17 06:54:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:54:56,489 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-02-17 06:54:56,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-17 06:54:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-02-17 06:54:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 06:54:56,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:54:56,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:54:56,498 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-17 06:54:56,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:54:56,690 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:54:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:54:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2023-02-17 06:54:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:54:56,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451794990] [2023-02-17 06:54:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:54:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:54:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:54:57,032 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-17 06:54:57,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:54:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451794990] [2023-02-17 06:54:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451794990] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:54:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:54:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 06:54:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249949048] [2023-02-17 06:54:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:54:57,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:54:57,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:54:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:54:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:54:57,040 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 06:54:59,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:01,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:55:02,768 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2023-02-17 06:55:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 06:55:02,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 13 [2023-02-17 06:55:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:55:02,771 INFO L225 Difference]: With dead ends: 64 [2023-02-17 06:55:02,771 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 06:55:02,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:55:02,772 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-02-17 06:55:02,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2023-02-17 06:55:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 06:55:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-17 06:55:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-17 06:55:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-02-17 06:55:02,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2023-02-17 06:55:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:55:02,785 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-02-17 06:55:02,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-17 06:55:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-02-17 06:55:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 06:55:02,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:55:02,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:55:02,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 06:55:02,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:55:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:55:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2023-02-17 06:55:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:55:02,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877736495] [2023-02-17 06:55:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:55:02,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:55:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764797718] [2023-02-17 06:55:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:55:02,811 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-17 06:55:02,814 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-17 06:55:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:55:02,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 06:55:02,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:55:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:55:02,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:55:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:55:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:55:02,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877736495] [2023-02-17 06:55:02,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:55:02,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764797718] [2023-02-17 06:55:02,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764797718] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:55:02,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:55:02,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-17 06:55:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509975188] [2023-02-17 06:55:02,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:55:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:55:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:55:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:55:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:55:02,895 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-17 06:55:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:55:02,926 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2023-02-17 06:55:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:55:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2023-02-17 06:55:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:55:02,929 INFO L225 Difference]: With dead ends: 63 [2023-02-17 06:55:02,929 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 06:55:02,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:55:02,934 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:55:02,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:55:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 06:55:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 06:55:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-17 06:55:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-02-17 06:55:02,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 15 [2023-02-17 06:55:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:55:02,951 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-02-17 06:55:02,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-17 06:55:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-02-17 06:55:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 06:55:02,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:55:02,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:55:02,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 06:55:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:03,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:55:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:55:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2023-02-17 06:55:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:55:03,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84067112] [2023-02-17 06:55:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:55:03,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:55:03,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544495992] [2023-02-17 06:55:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:03,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:55:03,188 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-17 06:55:03,189 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-17 06:55:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:55:03,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 06:55:03,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:55:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 06:55:03,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:55:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:55:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84067112] [2023-02-17 06:55:03,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:55:03,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544495992] [2023-02-17 06:55:03,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544495992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:55:03,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:55:03,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:55:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396860728] [2023-02-17 06:55:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:55:03,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:55:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:55:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:55:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:55:03,250 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-17 06:55:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:55:04,033 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2023-02-17 06:55:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:55:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2023-02-17 06:55:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:55:04,035 INFO L225 Difference]: With dead ends: 62 [2023-02-17 06:55:04,035 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 06:55:04,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-17 06:55:04,037 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 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.8s IncrementalHoareTripleChecker+Time [2023-02-17 06:55:04,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 06:55:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 06:55:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 06:55:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-02-17 06:55:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2023-02-17 06:55:04,053 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 16 [2023-02-17 06:55:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:55:04,054 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2023-02-17 06:55:04,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-17 06:55:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2023-02-17 06:55:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 06:55:04,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:55:04,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:55:04,063 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-17 06:55:04,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:04,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:55:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:55:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2015268129, now seen corresponding path program 1 times [2023-02-17 06:55:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:55:04,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722521171] [2023-02-17 06:55:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:55:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:55:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:55:04,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:55:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722521171] [2023-02-17 06:55:04,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722521171] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:55:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290093430] [2023-02-17 06:55:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:55:04,357 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-17 06:55:04,360 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-17 06:55:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:55:04,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 06:55:04,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:55:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:55:04,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:55:04,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290093430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:55:04,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 06:55:04,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-17 06:55:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773114430] [2023-02-17 06:55:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:55:04,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 06:55:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:55:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 06:55:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 06:55:04,429 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-17 06:55:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:55:04,468 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2023-02-17 06:55:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:55:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2023-02-17 06:55:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:55:04,471 INFO L225 Difference]: With dead ends: 71 [2023-02-17 06:55:04,471 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 06:55:04,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 06:55:04,473 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:55:04,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:55:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 06:55:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-17 06:55:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 06:55:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-02-17 06:55:04,492 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 16 [2023-02-17 06:55:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:55:04,492 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-02-17 06:55:04,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-17 06:55:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-02-17 06:55:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:55:04,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:55:04,493 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:55:04,502 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-17 06:55:04,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:04,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:55:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:55:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1484248551, now seen corresponding path program 1 times [2023-02-17 06:55:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:55:04,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230880649] [2023-02-17 06:55:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:55:04,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:55:04,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189554662] [2023-02-17 06:55:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:55:04,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:55:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:55:04,714 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-17 06:55:04,717 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-17 06:55:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:55:04,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 06:55:04,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:55:04,826 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-17 06:55:04,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:55:09,454 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-17 06:55:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:55:09,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230880649] [2023-02-17 06:55:09,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:55:09,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189554662] [2023-02-17 06:55:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189554662] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:55:09,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:55:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-17 06:55:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543519180] [2023-02-17 06:55:09,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:55:09,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 06:55:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:55:09,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 06:55:09,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-17 06:55:09,458 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 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-17 06:55:12,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:14,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:16,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:17,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:22,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:24,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:26,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:29,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:34,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:36,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:38,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:40,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:42,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:44,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:47,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:51,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:54,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:56,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:55:58,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:56:00,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:56:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:56:00,733 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-02-17 06:56:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:56:00,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 06:56:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:56:00,734 INFO L225 Difference]: With dead ends: 56 [2023-02-17 06:56:00,734 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 06:56:00,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-02-17 06:56:00,735 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.7s IncrementalHoareTripleChecker+Time [2023-02-17 06:56:00,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 14 Unknown, 0 Unchecked, 47.7s Time] [2023-02-17 06:56:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 06:56:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-02-17 06:56:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:56:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-02-17 06:56:00,740 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2023-02-17 06:56:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:56:00,740 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-02-17 06:56:00,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 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-17 06:56:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-02-17 06:56:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 06:56:00,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:56:00,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:56:00,751 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-17 06:56:00,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:56:00,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:56:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:56:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1651095472, now seen corresponding path program 1 times [2023-02-17 06:56:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:56:00,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922340081] [2023-02-17 06:56:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:56:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:56:00,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:56:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712581160] [2023-02-17 06:56:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:56:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:56:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:56:00,954 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-17 06:56:00,956 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-17 06:56:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:56:01,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 06:56:01,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:56:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 06:56:01,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:56:03,109 WARN L837 $PredicateComparison]: unable to prove that (or (= 0 (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 4294967295 |c_ULTIMATE.start_main_~n~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|)) 4294967296)) (forall ((|ULTIMATE.start_main_~h~0#1| Int)) (not (= 0 (mod (+ (* 4294967292 |c_ULTIMATE.start_main_~p~0#1|) (* 4294967295 |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* 4294967284 |ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~n~0#1|) (* 16 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~n~0#1|) (* 12 |ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~r~0#1|) (* 4294967280 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1|)) 4294967296))))) is different from false [2023-02-17 06:56:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:56:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922340081] [2023-02-17 06:56:03,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:56:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712581160] [2023-02-17 06:56:03,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712581160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:56:03,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 06:56:03,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-17 06:56:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075230336] [2023-02-17 06:56:03,112 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 06:56:03,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 06:56:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:56:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 06:56:03,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2023-02-17 06:56:03,113 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:56:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:56:03,146 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-02-17 06:56:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 06:56:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-17 06:56:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:56:03,146 INFO L225 Difference]: With dead ends: 24 [2023-02-17 06:56:03,146 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 06:56:03,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=33, Invalid=80, Unknown=1, NotChecked=18, Total=132 [2023-02-17 06:56:03,147 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:56:03,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:56:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 06:56:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 06:56:03,148 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-17 06:56:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 06:56:03,148 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-02-17 06:56:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:56:03,148 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 06:56:03,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:56:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 06:56:03,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 06:56:03,151 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 06:56:03,167 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-17 06:56:03,356 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,SelfDestructingSolverStorable8 [2023-02-17 06:56:03,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 06:56:03,369 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-02-17 06:56:03,370 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 06:56:03,370 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 0))) (or (and (let ((.cse1 (<= 0 (+ ~counter~0 (- 2))))) (or (and (= (mod (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~n~0#1|) 4294967296)) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2))) .cse3 .cse2) (let ((.cse14 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse8 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse6 (not (<= .cse8 0))) (.cse9 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse11 (* 4294967296 .cse14)) (.cse4 (<= (+ .cse14 1) 0)) (.cse10 (+ ~counter~0 (- 1)))) (and (or .cse4 (let ((.cse7 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse5 (<= (+ .cse7 .cse8 (* (- 1) .cse9)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse5)) (or .cse6 (<= (* 4294967296 .cse7) |ULTIMATE.start_main_~r~0#1|) .cse5))))) (<= 0 .cse10) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) .cse0 .cse3 .cse2 (let ((.cse13 (* 4294967296 .cse9)) (.cse12 (* 4294967296 .cse8))) (or .cse6 .cse4 (<= (+ .cse11 .cse12 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse13 (- 1))) (<= .cse13 (+ .cse12 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse11 4294967295)) (not .cse4)) (<= .cse10 0)))))) [2023-02-17 06:56:03,370 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2023-02-17 06:56:03,371 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 20 61) the Hoare annotation is: true [2023-02-17 06:56:03,371 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,371 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 06:56:03,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 06:56:03,371 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse2 (<= 0 (+ ~counter~0 (- 2)))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 0))) (or (and (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) .cse0 .cse1 .cse2 .cse3) (and (or (and (= (mod (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~n~0#1|) 4294967296)) .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse3)) .cse1 .cse3))) [2023-02-17 06:56:03,372 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,372 INFO L899 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2023-02-17 06:56:03,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 06:56:03,372 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~p~0#1| 0)) [2023-02-17 06:56:03,372 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 06:56:03,373 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-17 06:56:03,373 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2023-02-17 06:56:03,373 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse2 (<= 0 (+ ~counter~0 (- 2)))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 0))) (or (and (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) .cse0 .cse1 .cse2 .cse3) (and (or (and (= (mod (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~n~0#1|) 4294967296)) .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse3)) .cse1 .cse3))) [2023-02-17 06:56:03,373 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2023-02-17 06:56:03,373 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 0))) (or (and .cse0 .cse1 (<= 0 (+ ~counter~0 (- 2))) .cse2) (let ((.cse3 (+ ~counter~0 (- 1)))) (and (<= 0 .cse3) (= (mod (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~n~0#1|) 4294967296)) .cse0 .cse1 .cse2 (<= .cse3 0))) (and (or (<= (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) 1) 0) (let ((.cse6 (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse5 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse4 (<= (+ .cse6 .cse5 (* (- 1) (div |ULTIMATE.start_main_~r~0#1| 4294967296))) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse4)) (or (not (<= .cse5 0)) (<= (* 4294967296 .cse6) |ULTIMATE.start_main_~r~0#1|) .cse4))))) (>= ~counter~0 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) .cse0 .cse1 (<= ~counter~0 0) .cse2))) [2023-02-17 06:56:03,373 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 06:56:03,374 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,374 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,374 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse9 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse2 (not (<= .cse4 0))) (.cse5 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse6 (* 4294967296 .cse9)) (.cse0 (<= (+ .cse9 1) 0))) (and (or .cse0 (let ((.cse3 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (<= (+ .cse3 .cse4 (* (- 1) .cse5)) 0))) (and (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1)) (or .cse2 (<= (* 4294967296 .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1))))) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ |ULTIMATE.start_main_~q~0#1| (- 1)) 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 0 (+ ~counter~0 (- 2))) (= |ULTIMATE.start_main_~p~0#1| 0) (let ((.cse8 (* 4294967296 .cse5)) (.cse7 (* 4294967296 .cse4))) (or .cse2 .cse0 (<= (+ .cse6 .cse7 |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~q~0#1| .cse8 (- 1))) (<= .cse8 (+ .cse7 |ULTIMATE.start_main_~r~0#1| (- 4294967296))))) (or (<= |ULTIMATE.start_main_~q~0#1| (+ .cse6 4294967295)) (not .cse0))))) [2023-02-17 06:56:03,374 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-17 06:56:03,375 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-17 06:56:03,375 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-17 06:56:03,375 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-17 06:56:03,375 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: (let ((.cse3 (<= 0 (+ ~counter~0 (- 2)))) (.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (let ((.cse0 (not .cse2)) (.cse1 (not .cse3))) (and (or .cse0 .cse1 (and .cse2 .cse3)) (let ((.cse4 (= 0 |__VERIFIER_assert_#in~cond|))) (or .cse4 .cse0 (and .cse2 (not .cse4) .cse3) .cse1))))) [2023-02-17 06:56:03,375 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-17 06:56:03,378 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:56:03,380 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:56:03,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:56:03 BoogieIcfgContainer [2023-02-17 06:56:03,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:56:03,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:56:03,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:56:03,417 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:56:03,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:54:55" (3/4) ... [2023-02-17 06:56:03,420 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 06:56:03,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 06:56:03,429 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 06:56:03,430 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 06:56:03,430 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 06:56:03,430 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 06:56:03,467 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:56:03,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:56:03,468 INFO L158 Benchmark]: Toolchain (without parser) took 68861.20ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 74.4MB in the beginning and 109.1MB in the end (delta: -34.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:56:03,468 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:56:03,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.47ms. Allocated memory is still 121.6MB. Free memory was 74.0MB in the beginning and 62.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 06:56:03,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.98ms. Allocated memory is still 121.6MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:56:03,469 INFO L158 Benchmark]: Boogie Preprocessor took 19.77ms. Allocated memory is still 121.6MB. Free memory was 61.0MB in the beginning and 59.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:56:03,469 INFO L158 Benchmark]: RCFGBuilder took 291.20ms. Allocated memory is still 121.6MB. Free memory was 59.7MB in the beginning and 46.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 06:56:03,470 INFO L158 Benchmark]: TraceAbstraction took 68212.70ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 46.4MB in the beginning and 112.2MB in the end (delta: -65.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:56:03,470 INFO L158 Benchmark]: Witness Printer took 50.26ms. Allocated memory is still 146.8MB. Free memory was 112.2MB in the beginning and 109.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:56:03,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.47ms. Allocated memory is still 121.6MB. Free memory was 74.0MB in the beginning and 62.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.98ms. Allocated memory is still 121.6MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.77ms. Allocated memory is still 121.6MB. Free memory was 61.0MB in the beginning and 59.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 291.20ms. Allocated memory is still 121.6MB. Free memory was 59.7MB in the beginning and 46.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 68212.70ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 46.4MB in the beginning and 112.2MB in the end (delta: -65.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 50.26ms. Allocated memory is still 146.8MB. Free memory was 112.2MB in the beginning and 109.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: 14]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 54.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 54.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 591 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 306 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 79 PreInvPairs, 96 NumberOfFragments, 1646 HoareAnnotationTreeSize, 79 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1271 SizeOfPredicates, 13 NumberOfNonLiveVariables, 519 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 13/22 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: 38]: Loop Invariant Derived loop invariant: (((((((q * r + p * p) % 4294967296 == q * n % 4294967296 && h == 0) && 0 <= counter + -2) && p == 0) || ((h == 0 && 0 <= counter + -2) && p == 0)) && r == n) && p == 0) || (((((((((((q / 4294967296 + 1 <= 0 || ((r <= n || !(n / 4294967296 + (q + 2 * p) / 4294967296 + -1 * (r / 4294967296) <= 0)) && ((!((q + 2 * p) / 4294967296 <= 0) || 4294967296 * (n / 4294967296) <= r) || n / 4294967296 + (q + 2 * p) / 4294967296 + -1 * (r / 4294967296) <= 0))) && 0 <= counter + -1) && !(q % 4294967296 <= n % 4294967296)) && q == 1) && q + -1 == 0) && h == 0) && r == n) && p == 0) && (((!((q + 2 * p) / 4294967296 <= 0) || q / 4294967296 + 1 <= 0) || 4294967296 * (q / 4294967296) + 4294967296 * ((q + 2 * p) / 4294967296) + r <= q + 4294967296 * (r / 4294967296) + -1) || 4294967296 * (r / 4294967296) <= 4294967296 * ((q + 2 * p) / 4294967296) + r + -4294967296)) && (q <= 4294967296 * (q / 4294967296) + 4294967295 || !(q / 4294967296 + 1 <= 0))) && counter + -1 <= 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((h == 0 && r == n) && 0 <= counter + -2) && p == 0) || (((((0 <= counter + -1 && (q * r + p * p) % 4294967296 == q * n % 4294967296) && h == 0) && r == n) && p == 0) && counter + -1 <= 0)) || ((((((((q / 4294967296 + 1 <= 0 || ((r <= n || !(n / 4294967296 + (q + 2 * p) / 4294967296 + -1 * (r / 4294967296) <= 0)) && ((!((q + 2 * p) / 4294967296 <= 0) || 4294967296 * (n / 4294967296) <= r) || n / 4294967296 + (q + 2 * p) / 4294967296 + -1 * (r / 4294967296) <= 0))) && counter >= 0) && q == 1) && q + -1 == 0) && h == 0) && r == n) && counter <= 0) && p == 0) RESULT: Ultimate proved your program to be correct! [2023-02-17 06:56:03,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE