./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-dev-03d7b7b [2022-02-20 17:16:32,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:32,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:32,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:32,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:32,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:32,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:32,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:32,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:32,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:32,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:32,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:32,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:32,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:32,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:32,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:32,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:32,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:32,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:32,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:32,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:32,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:32,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:32,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:32,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:32,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:32,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:32,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:32,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:32,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:32,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:32,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:32,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:32,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:32,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:32,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:32,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:32,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:32,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:32,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:32,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:32,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:16:32,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:32,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:32,884 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:32,884 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:32,885 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:32,885 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:32,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:32,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:32,885 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:32,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:32,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:32,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:32,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:32,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:32,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:32,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:32,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:32,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:32,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:32,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:32,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:32,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:32,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca [2022-02-20 17:16:33,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:33,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:33,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:33,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:33,085 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:33,086 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 [2022-02-20 17:16:33,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243bd0f0f/dd1a7945936a4c9b845754fa581ecce3/FLAG585925069 [2022-02-20 17:16:33,445 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:33,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-02-20 17:16:33,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243bd0f0f/dd1a7945936a4c9b845754fa581ecce3/FLAG585925069 [2022-02-20 17:16:33,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243bd0f0f/dd1a7945936a4c9b845754fa581ecce3 [2022-02-20 17:16:33,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:33,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:33,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:33,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:33,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:33,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:33" (1/1) ... [2022-02-20 17:16:33,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5351fdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:33, skipping insertion in model container [2022-02-20 17:16:33,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:33" (1/1) ... [2022-02-20 17:16:33,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:33,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:34,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-02-20 17:16:34,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:34,071 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:34,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-02-20 17:16:34,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:34,112 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:34,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34 WrapperNode [2022-02-20 17:16:34,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:34,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:34,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:34,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:34,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,169 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-02-20 17:16:34,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:34,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:34,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:34,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:34,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:34,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:34,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:34,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:34,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (1/1) ... [2022-02-20 17:16:34,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:34,251 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) [2022-02-20 17:16:34,260 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 [2022-02-20 17:16:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:34,340 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:34,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:34,533 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:34,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:34,539 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:34,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:34 BoogieIcfgContainer [2022-02-20 17:16:34,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:34,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:34,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:34,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:34,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:33" (1/3) ... [2022-02-20 17:16:34,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad89c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:34, skipping insertion in model container [2022-02-20 17:16:34,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:34" (2/3) ... [2022-02-20 17:16:34,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad89c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:34, skipping insertion in model container [2022-02-20 17:16:34,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:34" (3/3) ... [2022-02-20 17:16:34,548 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2022-02-20 17:16:34,552 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:34,553 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:34,591 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:34,597 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:16:34,597 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:34,620 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) [2022-02-20 17:16:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:16:34,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:34,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:34,625 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-02-20 17:16:34,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:34,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481811071] [2022-02-20 17:16:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:34,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-02-20 17:16:34,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {33#true} is VALID [2022-02-20 17:16:34,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {34#false} is VALID [2022-02-20 17:16:34,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {34#false} is VALID [2022-02-20 17:16:34,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:34,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:34,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-02-20 17:16:34,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-02-20 17:16:34,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-02-20 17:16:34,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 17:16:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:34,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:34,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481811071] [2022-02-20 17:16:34,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481811071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:34,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:34,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:34,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309709756] [2022-02-20 17:16:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:34,829 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 [2022-02-20 17:16:34,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:34,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:16:34,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:34,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:34,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:34,896 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) [2022-02-20 17:16:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,261 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-02-20 17:16:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:37,261 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 [2022-02-20 17:16:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:37,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-20 17:16:37,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:37,419 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:16:37,419 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:16:37,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:37,425 INFO L933 BasicCegarLoop]: 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 [2022-02-20 17:16:37,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:16:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:16:37,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:37,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second 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) [2022-02-20 17:16:37,455 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second 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) [2022-02-20 17:16:37,455 INFO L87 Difference]: Start difference. First operand 26 states. Second 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) [2022-02-20 17:16:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,462 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:37,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:37,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:37,465 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 26 states. [2022-02-20 17:16:37,466 INFO L87 Difference]: Start difference. First 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) Second operand 26 states. [2022-02-20 17:16:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,476 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:37,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:37,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:37,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:37,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:37,478 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) [2022-02-20 17:16:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-02-20 17:16:37,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-02-20 17:16:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:37,485 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-02-20 17:16:37,485 INFO L471 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) [2022-02-20 17:16:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:16:37,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:37,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:37,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:37,487 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-02-20 17:16:37,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:37,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777982204] [2022-02-20 17:16:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:37,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:37,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:37,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:37,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:37,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:16:37,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {208#false} is VALID [2022-02-20 17:16:37,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:37,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#false} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:37,554 INFO L272 TraceCheckUtils]: 8: Hoare triple {208#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {208#false} is VALID [2022-02-20 17:16:37,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 17:16:37,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2022-02-20 17:16:37,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 17:16:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:37,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:37,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777982204] [2022-02-20 17:16:37,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777982204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:37,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:37,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:16:37,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663253698] [2022-02-20 17:16:37,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:37,557 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 [2022-02-20 17:16:37,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:37,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:16:37,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:37,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:16:37,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:16:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:37,568 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) [2022-02-20 17:16:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,675 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-02-20 17:16:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:16:45,676 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 [2022-02-20 17:16:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:45,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-02-20 17:16:45,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:45,749 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:16:45,749 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:16:45,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:45,750 INFO L933 BasicCegarLoop]: 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 [2022-02-20 17:16:45,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:16:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:16:45,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:45,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second 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) [2022-02-20 17:16:45,754 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second 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) [2022-02-20 17:16:45,754 INFO L87 Difference]: Start difference. First operand 28 states. Second 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) [2022-02-20 17:16:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,756 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:45,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:45,757 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 28 states. [2022-02-20 17:16:45,757 INFO L87 Difference]: Start difference. First 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) Second operand 28 states. [2022-02-20 17:16:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,759 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:45,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:45,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:45,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:45,760 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) [2022-02-20 17:16:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-02-20 17:16:45,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-02-20 17:16:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:45,762 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-02-20 17:16:45,762 INFO L471 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) [2022-02-20 17:16:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:45,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:45,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:45,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:16:45,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-02-20 17:16:45,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:45,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508622643] [2022-02-20 17:16:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:45,779 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:45,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974636327] [2022-02-20 17:16:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:45,783 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) [2022-02-20 17:16:45,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:16:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:45,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:16:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:45,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:45,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {383#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {396#(<= ~counter~0 1)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:16:45,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {379#false} is VALID [2022-02-20 17:16:45,978 INFO L272 TraceCheckUtils]: 9: Hoare triple {379#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {379#false} is VALID [2022-02-20 17:16:45,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#false} ~cond := #in~cond; {379#false} is VALID [2022-02-20 17:16:45,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#false} assume 0 == ~cond; {379#false} is VALID [2022-02-20 17:16:45,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:16:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:45,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:45,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:45,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508622643] [2022-02-20 17:16:45,980 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:45,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974636327] [2022-02-20 17:16:45,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974636327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:45,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:45,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:16:45,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43424624] [2022-02-20 17:16:45,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:45,981 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 [2022-02-20 17:16:45,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:45,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:16:45,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:45,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:45,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:45,992 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) [2022-02-20 17:16:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:52,531 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-20 17:16:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:52,532 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 [2022-02-20 17:16:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:16:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:52,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-20 17:16:52,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:52,580 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:16:52,580 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:16:52,580 INFO L932 BasicCegarLoop]: 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 [2022-02-20 17:16:52,581 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:52,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:16:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 17:16:52,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:52,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second 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) [2022-02-20 17:16:52,588 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second 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) [2022-02-20 17:16:52,589 INFO L87 Difference]: Start difference. First operand 32 states. Second 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) [2022-02-20 17:16:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:52,590 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:16:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:16:52,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:52,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:52,591 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 32 states. [2022-02-20 17:16:52,592 INFO L87 Difference]: Start difference. First 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) Second operand 32 states. [2022-02-20 17:16:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:52,593 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:16:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:16:52,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:52,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:52,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:52,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:52,594 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) [2022-02-20 17:16:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-02-20 17:16:52,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2022-02-20 17:16:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:52,609 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-02-20 17:16:52,609 INFO L471 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) [2022-02-20 17:16:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2022-02-20 17:16:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:52,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:52,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:52,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:16:52,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:52,811 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:52,811 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-02-20 17:16:52,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:52,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078436036] [2022-02-20 17:16:52,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:53,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {586#true} is VALID [2022-02-20 17:16:53,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {586#true} is VALID [2022-02-20 17:16:53,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume !(0 == assume_abort_if_not_~cond#1); {586#true} is VALID [2022-02-20 17:16:53,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {586#true} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,041 INFO L272 TraceCheckUtils]: 9: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {590#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:53,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {590#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {591#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:16:53,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {591#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {587#false} is VALID [2022-02-20 17:16:53,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-02-20 17:16:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:53,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:53,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078436036] [2022-02-20 17:16:53,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078436036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:53,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:53,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:16:53,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425875904] [2022-02-20 17:16:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:53,047 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 [2022-02-20 17:16:53,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:53,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:16:53,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:53,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:53,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:53,062 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) [2022-02-20 17:17:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:05,816 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-02-20 17:17:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:17:05,816 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 [2022-02-20 17:17:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:05,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-02-20 17:17:05,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:05,922 INFO L225 Difference]: With dead ends: 64 [2022-02-20 17:17:05,922 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:17:05,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:05,923 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:05,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 181 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:17:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:17:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-02-20 17:17:05,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:05,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second 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) [2022-02-20 17:17:05,942 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second 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) [2022-02-20 17:17:05,942 INFO L87 Difference]: Start difference. First operand 45 states. Second 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) [2022-02-20 17:17:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:05,944 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:05,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:05,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:05,945 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 45 states. [2022-02-20 17:17:05,946 INFO L87 Difference]: Start difference. First 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) Second operand 45 states. [2022-02-20 17:17:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:05,948 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:05,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:05,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:05,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:05,949 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) [2022-02-20 17:17:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-02-20 17:17:05,951 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2022-02-20 17:17:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:05,951 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-02-20 17:17:05,952 INFO L471 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) [2022-02-20 17:17:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-02-20 17:17:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:17:05,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:05,952 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:05,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:17:05,952 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2022-02-20 17:17:05,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:05,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354623321] [2022-02-20 17:17:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:05,963 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:05,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271798489] [2022-02-20 17:17:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:05,969 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) [2022-02-20 17:17:05,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:17:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:06,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:17:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:06,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:06,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {850#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:17:06,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:06,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:06,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:06,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {846#false} is VALID [2022-02-20 17:17:06,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:06,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:06,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:06,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:06,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:06,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:06,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:06,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {846#false} is VALID [2022-02-20 17:17:06,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:06,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:06,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:06,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:17:06,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {850#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:06,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:06,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:06,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354623321] [2022-02-20 17:17:06,174 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:06,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271798489] [2022-02-20 17:17:06,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271798489] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:06,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:17:06,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-02-20 17:17:06,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065341263] [2022-02-20 17:17:06,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:06,175 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 [2022-02-20 17:17:06,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:06,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:17:06,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:06,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:06,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:06,185 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) [2022-02-20 17:17:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:11,262 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2022-02-20 17:17:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:17:11,262 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 [2022-02-20 17:17:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-02-20 17:17:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-02-20 17:17:11,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-02-20 17:17:11,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:11,331 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:17:11,331 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:17:11,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:17:11,333 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:11,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:17:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:17:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:17:11,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:11,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second 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) [2022-02-20 17:17:11,351 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second 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) [2022-02-20 17:17:11,352 INFO L87 Difference]: Start difference. First operand 44 states. Second 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) [2022-02-20 17:17:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:11,353 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-02-20 17:17:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-02-20 17:17:11,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:11,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:11,354 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 44 states. [2022-02-20 17:17:11,354 INFO L87 Difference]: Start difference. First 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) Second operand 44 states. [2022-02-20 17:17:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:11,356 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-02-20 17:17:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-02-20 17:17:11,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:11,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:11,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:11,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:11,357 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) [2022-02-20 17:17:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2022-02-20 17:17:11,359 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 15 [2022-02-20 17:17:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:11,359 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2022-02-20 17:17:11,359 INFO L471 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) [2022-02-20 17:17:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-02-20 17:17:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:17:11,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:11,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:11,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:17:11,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:11,575 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2022-02-20 17:17:11,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:11,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107517381] [2022-02-20 17:17:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:11,586 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:11,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990061316] [2022-02-20 17:17:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:11,588 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) [2022-02-20 17:17:11,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:17:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:11,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:11,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:11,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1183#true} is VALID [2022-02-20 17:17:11,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1183#true} is VALID [2022-02-20 17:17:11,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume !(0 == assume_abort_if_not_~cond#1); {1183#true} is VALID [2022-02-20 17:17:11,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {1183#true} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:17:11,739 INFO L272 TraceCheckUtils]: 12: Hoare triple {1197#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {1225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:11,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {1225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:11,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1184#false} is VALID [2022-02-20 17:17:11,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-02-20 17:17:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:17:11,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:11,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:11,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107517381] [2022-02-20 17:17:11,741 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:11,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990061316] [2022-02-20 17:17:11,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990061316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:11,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:11,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:17:11,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340085518] [2022-02-20 17:17:11,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:11,742 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 [2022-02-20 17:17:11,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:11,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:17:11,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:11,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:11,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:11,756 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) [2022-02-20 17:17:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:16,749 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2022-02-20 17:17:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:17:16,749 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 [2022-02-20 17:17:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:17:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:17:16,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 17:17:16,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:16,833 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:17:16,833 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:17:16,834 INFO L932 BasicCegarLoop]: 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 [2022-02-20 17:17:16,834 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:16,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:17:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:17:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-20 17:17:16,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:16,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second 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) [2022-02-20 17:17:16,873 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second 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) [2022-02-20 17:17:16,873 INFO L87 Difference]: Start difference. First operand 59 states. Second 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) [2022-02-20 17:17:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:16,878 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-20 17:17:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-20 17:17:16,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:16,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:16,879 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 59 states. [2022-02-20 17:17:16,881 INFO L87 Difference]: Start difference. First 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) Second operand 59 states. [2022-02-20 17:17:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:16,884 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-20 17:17:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-20 17:17:16,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:16,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:16,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:16,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:16,885 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) [2022-02-20 17:17:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2022-02-20 17:17:16,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 16 [2022-02-20 17:17:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:16,888 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2022-02-20 17:17:16,888 INFO L471 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) [2022-02-20 17:17:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-20 17:17:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:17:16,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:16,888 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:16,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:17:17,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:17,092 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2015268129, now seen corresponding path program 1 times [2022-02-20 17:17:17,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:17,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812245766] [2022-02-20 17:17:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:17,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1537#(= ~counter~0 0)} is VALID [2022-02-20 17:17:17,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1537#(= ~counter~0 0)} is VALID [2022-02-20 17:17:17,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1537#(= ~counter~0 0)} is VALID [2022-02-20 17:17:17,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {1537#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1537#(= ~counter~0 0)} is VALID [2022-02-20 17:17:17,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {1537#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1538#(and (= |ULTIMATE.start_main_#t~post5#1| 0) (<= (+ |ULTIMATE.start_main_#t~post5#1| 1) ~counter~0))} is VALID [2022-02-20 17:17:17,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1538#(and (= |ULTIMATE.start_main_#t~post5#1| 0) (<= (+ |ULTIMATE.start_main_#t~post5#1| 1) ~counter~0))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1539#(<= 1 ~counter~0)} is VALID [2022-02-20 17:17:17,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1539#(<= 1 ~counter~0)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1539#(<= 1 ~counter~0)} is VALID [2022-02-20 17:17:17,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= 1 ~counter~0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#(<= 2 ~counter~0)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#(<= 2 ~counter~0)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(<= 2 ~counter~0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1541#(<= 2 |ULTIMATE.start_main_#t~post6#1|)} is VALID [2022-02-20 17:17:17,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#(<= 2 |ULTIMATE.start_main_#t~post6#1|)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1536#false} is VALID [2022-02-20 17:17:17,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {1536#false} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1536#false} is VALID [2022-02-20 17:17:17,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {1536#false} ~cond := #in~cond; {1536#false} is VALID [2022-02-20 17:17:17,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1536#false} assume 0 == ~cond; {1536#false} is VALID [2022-02-20 17:17:17,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-02-20 17:17:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:17,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:17,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812245766] [2022-02-20 17:17:17,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812245766] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:17:17,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236476375] [2022-02-20 17:17:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:17,170 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) [2022-02-20 17:17:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:17:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:17,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:17,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:17,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {1535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1545#(<= 0 ~counter~0)} is VALID [2022-02-20 17:17:17,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#(<= 0 ~counter~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1545#(<= 0 ~counter~0)} is VALID [2022-02-20 17:17:17,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#(<= 0 ~counter~0)} assume !(0 == assume_abort_if_not_~cond#1); {1545#(<= 0 ~counter~0)} is VALID [2022-02-20 17:17:17,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {1545#(<= 0 ~counter~0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1545#(<= 0 ~counter~0)} is VALID [2022-02-20 17:17:17,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {1545#(<= 0 ~counter~0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1539#(<= 1 ~counter~0)} is VALID [2022-02-20 17:17:17,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1539#(<= 1 ~counter~0)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1539#(<= 1 ~counter~0)} is VALID [2022-02-20 17:17:17,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {1539#(<= 1 ~counter~0)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1539#(<= 1 ~counter~0)} is VALID [2022-02-20 17:17:17,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= 1 ~counter~0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#(<= 2 ~counter~0)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#(<= 2 ~counter~0)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1540#(<= 2 ~counter~0)} is VALID [2022-02-20 17:17:17,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(<= 2 ~counter~0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1541#(<= 2 |ULTIMATE.start_main_#t~post6#1|)} is VALID [2022-02-20 17:17:17,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#(<= 2 |ULTIMATE.start_main_#t~post6#1|)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1536#false} is VALID [2022-02-20 17:17:17,332 INFO L272 TraceCheckUtils]: 12: Hoare triple {1536#false} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1536#false} is VALID [2022-02-20 17:17:17,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1536#false} ~cond := #in~cond; {1536#false} is VALID [2022-02-20 17:17:17,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1536#false} assume 0 == ~cond; {1536#false} is VALID [2022-02-20 17:17:17,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-02-20 17:17:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:17,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:17,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236476375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:17,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:17:17,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:17:17,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524510122] [2022-02-20 17:17:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:17,334 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 [2022-02-20 17:17:17,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:17,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:17:17,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:17,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:17:17,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:17:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:17,346 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) [2022-02-20 17:17:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:23,249 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-02-20 17:17:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:17:23,250 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 [2022-02-20 17:17:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 17:17:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:17:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 17:17:23,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-02-20 17:17:23,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:23,307 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:17:23,307 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:17:23,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:17:23,308 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:23,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 70 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:17:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:17:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:17:23,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:23,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second 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) [2022-02-20 17:17:23,336 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second 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) [2022-02-20 17:17:23,336 INFO L87 Difference]: Start difference. First operand 39 states. Second 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) [2022-02-20 17:17:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:23,337 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 17:17:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 17:17:23,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:23,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:23,338 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 39 states. [2022-02-20 17:17:23,338 INFO L87 Difference]: Start difference. First 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) Second operand 39 states. [2022-02-20 17:17:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:23,339 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 17:17:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 17:17:23,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:23,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:23,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:23,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:23,340 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) [2022-02-20 17:17:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-02-20 17:17:23,341 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 16 [2022-02-20 17:17:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:23,341 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-02-20 17:17:23,341 INFO L471 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) [2022-02-20 17:17:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 17:17:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:17:23,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:23,342 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:23,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:17:23,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:23,555 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1484248551, now seen corresponding path program 1 times [2022-02-20 17:17:23,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:23,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737739682] [2022-02-20 17:17:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:23,581 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:23,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414725132] [2022-02-20 17:17:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:23,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:23,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:23,587 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) [2022-02-20 17:17:23,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:17:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:23,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:23,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:23,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1827#true} is VALID [2022-02-20 17:17:23,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1827#true} is VALID [2022-02-20 17:17:23,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume !(0 == assume_abort_if_not_~cond#1); {1827#true} is VALID [2022-02-20 17:17:23,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {1827#true} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,707 INFO L272 TraceCheckUtils]: 9: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1827#true} is VALID [2022-02-20 17:17:23,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-02-20 17:17:23,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-02-20 17:17:23,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-02-20 17:17:23,707 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1827#true} {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:23,708 INFO L272 TraceCheckUtils]: 14: Hoare triple {1841#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if (main_~p~0#1 * main_~p~0#1 + main_~r~0#1 * main_~q~0#1) % 4294967296 == main_~n~0#1 * main_~q~0#1 % 4294967296 then 1 else 0)); {1875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:23,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {1875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:23,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-02-20 17:17:23,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-02-20 17:17:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:23,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:23,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:23,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737739682] [2022-02-20 17:17:23,709 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:23,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414725132] [2022-02-20 17:17:23,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414725132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:23,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:23,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:17:23,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225682874] [2022-02-20 17:17:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2022-02-20 17:17:23,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:23,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-02-20 17:17:23,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:23,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:23,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:23,735 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-02-20 17:17:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:23,902 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 17:17:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:17:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2022-02-20 17:17:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-02-20 17:17:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:17:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-02-20 17:17:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:17:23,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:17:24,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:24,065 INFO L225 Difference]: With dead ends: 43 [2022-02-20 17:17:24,065 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:17:24,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:17:24,066 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:24,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 79 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:17:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:17:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:17:24,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:24,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 17:17:24,067 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 17:17:24,067 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 17:17:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:24,067 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:17:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:17:24,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:24,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:24,067 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 17:17:24,067 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 17:17:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:24,068 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:17:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:17:24,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:24,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:24,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:24,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:24,068 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) [2022-02-20 17:17:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:17:24,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 17:17:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:24,068 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:17:24,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-02-20 17:17:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:17:24,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:24,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:17:24,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:17:24,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:24,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:17:24,542 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L861 garLoopResultBuilder]: At program point L60(lines 20 61) the Hoare annotation is: true [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,543 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:17:24,543 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:17:24,544 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0)) [2022-02-20 17:17:24,544 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,544 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 17:17:24,544 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-02-20 17:17:24,544 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,544 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-02-20 17:17:24,544 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~q~0#1| 1) (= ~counter~0 0) .cse2) (and .cse0 .cse1 (<= 1 ~counter~0) .cse2))) [2022-02-20 17:17:24,544 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-02-20 17:17:24,544 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,545 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,545 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:17:24,545 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-02-20 17:17:24,545 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-20 17:17:24,545 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-02-20 17:17:24,545 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:17:24,545 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:17:24,545 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 17:17:24,547 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:24,548 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:17:24,550 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:17:24,550 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:17:24,552 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:17:24,553 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:17:24,554 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:17:24,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:17:24 BoogieIcfgContainer [2022-02-20 17:17:24,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:17:24,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:17:24,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:17:24,561 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:17:24,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:34" (3/4) ... [2022-02-20 17:17:24,562 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:17:24,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:17:24,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:17:24,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:17:24,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:17:24,568 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:17:24,599 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:17:24,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:17:24,600 INFO L158 Benchmark]: Toolchain (without parser) took 50713.99ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 70.4MB in the beginning and 91.1MB in the end (delta: -20.7MB). Peak memory consumption was 539.3kB. Max. memory is 16.1GB. [2022-02-20 17:17:24,600 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:17:24,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.15ms. Allocated memory is still 100.7MB. Free memory was 70.4MB in the beginning and 74.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.73ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 72.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,601 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 100.7MB. Free memory was 72.7MB in the beginning and 71.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,601 INFO L158 Benchmark]: RCFGBuilder took 326.73ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 59.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,601 INFO L158 Benchmark]: TraceAbstraction took 50018.05ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.2MB in the beginning and 94.3MB in the end (delta: -36.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,602 INFO L158 Benchmark]: Witness Printer took 38.61ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:17:24,604 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.15ms. Allocated memory is still 100.7MB. Free memory was 70.4MB in the beginning and 74.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.73ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 72.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 100.7MB. Free memory was 72.7MB in the beginning and 71.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.73ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 59.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50018.05ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.2MB in the beginning and 94.3MB in the end (delta: -36.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Witness Printer took 38.61ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 50.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 294 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 76 PreInvPairs, 89 NumberOfFragments, 311 HoareAnnotationTreeSize, 76 FomulaSimplifications, 41 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 6 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 9/15 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((p == 0 && h == 0) && q == 1) && counter == 0) && n == r) || (((p == 0 && h == 0) && 1 <= counter) && n == r) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:17:24,632 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