/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:19,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:19,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:19,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:19,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:19,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:19,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:19,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:19,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:19,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:19,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:19,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:19,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:19,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:19,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:19,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:19,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:19,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:19,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:19,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:19,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:19,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:19,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:19,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:19,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:19,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:19,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:19,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:19,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:19,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:19,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:19,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:19,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:19,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:19,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:19,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:19,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:19,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:19,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:19,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:19,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:19,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:19,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:17:19,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:19,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:19,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:19,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:19,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:19,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:19,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:19,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:19,243 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:19,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:19,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:19,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:19,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:19,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:19,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:19,246 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:17:19,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:19,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:19,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:19,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:19,422 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:19,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-27 12:17:19,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fca84700/507e5189567a4e57ac133d1596731e99/FLAG2dca36893 [2022-04-27 12:17:19,857 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:19,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-27 12:17:19,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fca84700/507e5189567a4e57ac133d1596731e99/FLAG2dca36893 [2022-04-27 12:17:19,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fca84700/507e5189567a4e57ac133d1596731e99 [2022-04-27 12:17:19,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:19,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:19,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:19,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:19,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:19,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:19" (1/1) ... [2022-04-27 12:17:19,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6323011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:19, skipping insertion in model container [2022-04-27 12:17:19,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:19" (1/1) ... [2022-04-27 12:17:19,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:19,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:20,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c[525,538] [2022-04-27 12:17:20,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:20,084 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:20,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c[525,538] [2022-04-27 12:17:20,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:20,117 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:20,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20 WrapperNode [2022-04-27 12:17:20,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:20,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:20,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:20,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:20,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:20,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:20,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:20,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:20,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (1/1) ... [2022-04-27 12:17:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:20,192 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-04-27 12:17:20,203 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-04-27 12:17:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:20,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:20,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:20,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:20,269 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:20,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:20,454 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:20,463 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:20,463 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:20,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:20 BoogieIcfgContainer [2022-04-27 12:17:20,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:20,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:20,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:20,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:20,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:19" (1/3) ... [2022-04-27 12:17:20,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611db95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:20, skipping insertion in model container [2022-04-27 12:17:20,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:20" (2/3) ... [2022-04-27 12:17:20,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611db95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:20, skipping insertion in model container [2022-04-27 12:17:20,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:20" (3/3) ... [2022-04-27 12:17:20,472 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2022-04-27 12:17:20,485 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:20,485 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:20,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:20,537 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64f9598d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e22ddba [2022-04-27 12:17:20,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:17:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:20,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:20,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:20,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:20,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256159420] [2022-04-27 12:17:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:20,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {42#true} is VALID [2022-04-27 12:17:20,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:20,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:20,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:20,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:20,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:20,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:20,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:20,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {42#true} is VALID [2022-04-27 12:17:20,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:20,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:20,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:20,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-27 12:17:20,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-27 12:17:20,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:20,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:20,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:20,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:20,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-27 12:17:20,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:20,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:20,782 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-27 12:17:20,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:20,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:20,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256159420] [2022-04-27 12:17:20,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256159420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:20,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:20,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59004100] [2022-04-27 12:17:20,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:17:20,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:20,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:20,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:20,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:20,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:20,844 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:23,177 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:23,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:17:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:23,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:23,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:23,352 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:23,352 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:23,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:23,358 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:23,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:17:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:23,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:23,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:23,388 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:23,389 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:23,403 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:23,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:23,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:23,406 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:23,411 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:23,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:23,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:23,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:23,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:23,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:23,419 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:23,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:23,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:23,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:23,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:23,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:23,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353038130] [2022-04-27 12:17:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:23,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807414615] [2022-04-27 12:17:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:23,445 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-04-27 12:17:23,446 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-04-27 12:17:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:23,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:23,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:23,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:23,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#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; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:23,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 12:17:23,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:23,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-27 12:17:23,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 1);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:23,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-27 12:17:23,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:23,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:23,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:23,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:23,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353038130] [2022-04-27 12:17:23,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:23,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807414615] [2022-04-27 12:17:23,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807414615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:23,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:23,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335692784] [2022-04-27 12:17:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:23,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:23,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:23,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:23,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:23,720 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:29,983 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:29,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:30,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:30,060 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:30,060 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:30,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-04-27 12:17:30,061 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:30,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:17:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:30,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:30,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:30,073 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:30,074 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:30,082 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:30,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:30,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:30,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:30,088 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:30,090 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:30,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:30,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:30,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:30,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:30,092 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:30,092 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:30,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:30,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:30,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:30,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:17:30,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:30,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192800947] [2022-04-27 12:17:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:30,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:30,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716026191] [2022-04-27 12:17:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:30,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:30,333 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-04-27 12:17:30,334 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-04-27 12:17:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:30,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:30,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:30,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:30,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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; {546#true} is VALID [2022-04-27 12:17:30,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-27 12:17:30,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #102#return; {546#true} is VALID [2022-04-27 12:17:30,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret7 := main(); {546#true} is VALID [2022-04-27 12:17:30,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {546#true} is VALID [2022-04-27 12:17:30,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {546#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {546#true} is VALID [2022-04-27 12:17:30,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {546#true} ~cond := #in~cond; {546#true} is VALID [2022-04-27 12:17:30,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {546#true} assume !(0 == ~cond); {546#true} is VALID [2022-04-27 12:17:30,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-27 12:17:30,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {546#true} {546#true} #82#return; {546#true} is VALID [2022-04-27 12:17:30,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 1);havoc #t~post6; {584#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:17:30,621 INFO L272 TraceCheckUtils]: 17: Hoare triple {584#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:17:30,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:17:30,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:30,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:30,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:30,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192800947] [2022-04-27 12:17:30,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:30,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716026191] [2022-04-27 12:17:30,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716026191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:30,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:30,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582740616] [2022-04-27 12:17:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:30,627 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:17:30,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:30,627 INFO L86 InductivityCheck]: Starting inductivity 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:30,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:30,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:30,646 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:40,552 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-04-27 12:17:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:17:40,552 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-27 12:17:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:40,553 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 12:17:40,564 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 12:17:40,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-27 12:17:40,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:40,664 INFO L225 Difference]: With dead ends: 54 [2022-04-27 12:17:40,664 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:17:40,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-04-27 12:17:40,665 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:40,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 12:17:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:17:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:17:40,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:40,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:17:40,678 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:17:40,679 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:17:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:40,681 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-27 12:17:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-27 12:17:40,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:40,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:40,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-04-27 12:17:40,682 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-04-27 12:17:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:40,684 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-27 12:17:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-27 12:17:40,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:40,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:40,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:40,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:17:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-04-27 12:17:40,687 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 21 [2022-04-27 12:17:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:40,687 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-04-27 12:17:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-27 12:17:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:40,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:40,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:40,699 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-04-27 12:17:40,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:17:40,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:17:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:40,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181197957] [2022-04-27 12:17:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:40,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:40,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#(<= 0 ~counter~0)} assume true; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:40,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {882#(<= 0 ~counter~0)} {877#true} #102#return; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:41,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 12:17:41,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 12:17:41,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 12:17:41,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {882#(<= 0 ~counter~0)} #82#return; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {889#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:41,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#(<= 0 ~counter~0)} assume true; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {882#(<= 0 ~counter~0)} {877#true} #102#return; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {882#(<= 0 ~counter~0)} call #t~ret7 := main(); {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#(<= 0 ~counter~0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {882#(<= 0 ~counter~0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {877#true} is VALID [2022-04-27 12:17:41,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 12:17:41,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 12:17:41,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 12:17:41,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {882#(<= 0 ~counter~0)} #82#return; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#(<= 0 ~counter~0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {882#(<= 0 ~counter~0)} is VALID [2022-04-27 12:17:41,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {887#(<= 1 ~counter~0)} is VALID [2022-04-27 12:17:41,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {887#(<= 1 ~counter~0)} assume !!(#t~post5 < 1);havoc #t~post5; {887#(<= 1 ~counter~0)} is VALID [2022-04-27 12:17:41,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#(<= 1 ~counter~0)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {887#(<= 1 ~counter~0)} is VALID [2022-04-27 12:17:41,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {888#(<= 1 |main_#t~post6|)} is VALID [2022-04-27 12:17:41,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(<= 1 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6; {878#false} is VALID [2022-04-27 12:17:41,010 INFO L272 TraceCheckUtils]: 17: Hoare triple {878#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {878#false} is VALID [2022-04-27 12:17:41,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#false} ~cond := #in~cond; {878#false} is VALID [2022-04-27 12:17:41,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#false} assume 0 == ~cond; {878#false} is VALID [2022-04-27 12:17:41,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 12:17:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:41,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181197957] [2022-04-27 12:17:41,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181197957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:41,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:41,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:17:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242160860] [2022-04-27 12:17:41,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:41,011 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:17:41,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:41,012 INFO L86 InductivityCheck]: Starting inductivity 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:41,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:17:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:17:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:17:41,024 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:42,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:17:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,732 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2022-04-27 12:17:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:17:42,733 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:17:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:42,733 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-27 12:17:42,734 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-27 12:17:42,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-27 12:17:42,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:42,810 INFO L225 Difference]: With dead ends: 63 [2022-04-27 12:17:42,810 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:17:42,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:17:42,811 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:42,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 12:17:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:17:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 12:17:42,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:42,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:17:42,822 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:17:42,822 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:17:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,823 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 12:17:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 12:17:42,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:42,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:42,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 12:17:42,824 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 12:17:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,825 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 12:17:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 12:17:42,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:42,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:42,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:42,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:17:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 12:17:42,826 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2022-04-27 12:17:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:42,826 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 12:17:42,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 12:17:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:17:42,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:42,827 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:42,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:17:42,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1439696200, now seen corresponding path program 1 times [2022-04-27 12:17:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:42,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11693561] [2022-04-27 12:17:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:42,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:42,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366587978] [2022-04-27 12:17:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:42,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:42,838 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-04-27 12:17:42,839 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-04-27 12:17:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:42,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:42,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:42,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2022-04-27 12:17:42,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#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; {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #102#return; {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret7 := main(); {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {1092#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1092#true} is VALID [2022-04-27 12:17:42,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 12:17:42,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 12:17:42,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 12:17:42,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1092#true} {1092#true} #82#return; {1092#true} is VALID [2022-04-27 12:17:42,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 1);havoc #t~post5; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post6 < 1);havoc #t~post6; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,996 INFO L272 TraceCheckUtils]: 17: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1092#true} is VALID [2022-04-27 12:17:42,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 12:17:42,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 12:17:42,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 12:17:42,998 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1092#true} {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #96#return; {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:17:42,999 INFO L272 TraceCheckUtils]: 22: Hoare triple {1130#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {1164#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:17:43,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {1164#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1168#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:17:43,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {1168#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1093#false} is VALID [2022-04-27 12:17:43,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-04-27 12:17:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:43,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11693561] [2022-04-27 12:17:43,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366587978] [2022-04-27 12:17:43,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366587978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:43,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:43,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322751500] [2022-04-27 12:17:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:43,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:17:43,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:43,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:43,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:43,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:43,034 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,147 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 12:17:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:17:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:17:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 12:17:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 12:17:43,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-27 12:17:43,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:43,168 INFO L225 Difference]: With dead ends: 29 [2022-04-27 12:17:43,168 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:17:43,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-04-27 12:17:43,169 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:43,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:17:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:17:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:17:43,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:43,170 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-04-27 12:17:43,170 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-04-27 12:17:43,170 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-04-27 12:17:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,170 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:17:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:17:43,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:43,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:43,171 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-04-27 12:17:43,171 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-04-27 12:17:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:43,171 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:17:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:17:43,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:43,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:43,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:43,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:43,171 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-04-27 12:17:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:17:43,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 12:17:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:43,171 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:17:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:17:43,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:43,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:17:43,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:17:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:43,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-04-27 12:17:43,554 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 61) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 61) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,555 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 0 ~counter~0) (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:17:43,556 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:17:43,556 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 12:17:43,556 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 12:17:43,557 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 12:17:43,557 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 12:17:43,557 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 12:17:43,557 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 12:17:43,559 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 12:17:43,560 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:17:43,562 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:17:43,562 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:17:43,563 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:17:43,565 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 12:17:43,566 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 12:17:43,567 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 12:17:43,567 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 12:17:43,567 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:17:43,567 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:17:43,567 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:17:43,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:17:43 BoogieIcfgContainer [2022-04-27 12:17:43,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:17:43,574 INFO L158 Benchmark]: Toolchain (without parser) took 23697.29ms. Allocated memory was 191.9MB in the beginning and 264.2MB in the end (delta: 72.4MB). Free memory was 140.7MB in the beginning and 207.6MB in the end (delta: -66.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-27 12:17:43,574 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory was 157.1MB in the beginning and 156.9MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:17:43,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.18ms. Allocated memory is still 191.9MB. Free memory was 140.4MB in the beginning and 164.5MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:17:43,578 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 191.9MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:17:43,579 INFO L158 Benchmark]: RCFGBuilder took 297.22ms. Allocated memory is still 191.9MB. Free memory was 162.9MB in the beginning and 149.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:17:43,579 INFO L158 Benchmark]: TraceAbstraction took 23107.05ms. Allocated memory was 191.9MB in the beginning and 264.2MB in the end (delta: 72.4MB). Free memory was 148.9MB in the beginning and 207.6MB in the end (delta: -58.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-04-27 12:17:43,580 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.09ms. Allocated memory is still 191.9MB. Free memory was 157.1MB in the beginning and 156.9MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.18ms. Allocated memory is still 191.9MB. Free memory was 140.4MB in the beginning and 164.5MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 191.9MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 297.22ms. Allocated memory is still 191.9MB. Free memory was 162.9MB in the beginning and 149.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 23107.05ms. Allocated memory was 191.9MB in the beginning and 264.2MB in the end (delta: 72.4MB). Free memory was 148.9MB in the beginning and 207.6MB in the end (delta: -58.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * 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 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 186 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 54 PreInvPairs, 59 NumberOfFragments, 188 HoareAnnotationTreeSize, 54 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 3 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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: 30]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || (((p == 0 && n == r) && 0 <= counter) && h == 0)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:17:43,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...