/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:02:15,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:02:15,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:02:15,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:02:15,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:02:15,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:02:15,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:02:15,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:02:15,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:02:15,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:02:15,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:02:15,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:02:15,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:02:15,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:02:15,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:02:15,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:02:15,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:02:15,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:02:15,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:02:15,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:02:15,242 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:02:15,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:02:15,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:02:15,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:02:15,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:02:15,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:02:15,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:02:15,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:02:15,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:02:15,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:02:15,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:02:15,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:02:15,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:02:15,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:02:15,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:02:15,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:02:15,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:02:15,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:02:15,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:02:15,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:02:15,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:02:15,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:02:15,273 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-07 13:02:15,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:02:15,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:02:15,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:02:15,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:02:15,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:02:15,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:02:15,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:02:15,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:02:15,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:02:15,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:02:15,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:15,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:02:15,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:02:15,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:02:15,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:02:15,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:02:15,292 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:02:15,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:02:15,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:02:15,293 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-07 13:02:15,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:02:15,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:02:15,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:02:15,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:02:15,528 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:02:15,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-07 13:02:15,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1bf9624/3906b8299260423eac44f2075336a443/FLAG74c464f7a [2022-04-07 13:02:15,940 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:02:15,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-07 13:02:15,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1bf9624/3906b8299260423eac44f2075336a443/FLAG74c464f7a [2022-04-07 13:02:15,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1bf9624/3906b8299260423eac44f2075336a443 [2022-04-07 13:02:15,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:02:15,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:02:15,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:15,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:02:15,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:02:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:15" (1/1) ... [2022-04-07 13:02:15,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcd46c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:15, skipping insertion in model container [2022-04-07 13:02:15,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:15" (1/1) ... [2022-04-07 13:02:15,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:02:15,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:02:16,115 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_unwindbound10.c[525,538] [2022-04-07 13:02:16,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:16,155 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:02:16,162 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_unwindbound10.c[525,538] [2022-04-07 13:02:16,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:16,199 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:02:16,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16 WrapperNode [2022-04-07 13:02:16,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:16,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:02:16,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:02:16,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:02:16,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:02:16,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:02:16,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:02:16,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:02:16,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (1/1) ... [2022-04-07 13:02:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:16,265 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-07 13:02:16,269 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-07 13:02:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:02:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:02:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:02:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:02:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:02:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:02:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:02:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:02:16,345 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:02:16,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:02:16,565 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:02:16,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:02:16,571 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:02:16,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:16 BoogieIcfgContainer [2022-04-07 13:02:16,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:02:16,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:02:16,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:02:16,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:02:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:02:15" (1/3) ... [2022-04-07 13:02:16,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b20ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:16, skipping insertion in model container [2022-04-07 13:02:16,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:16" (2/3) ... [2022-04-07 13:02:16,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b20ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:16, skipping insertion in model container [2022-04-07 13:02:16,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:16" (3/3) ... [2022-04-07 13:02:16,581 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2022-04-07 13:02:16,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:02:16,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:02:16,615 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:02:16,620 INFO L340 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 [2022-04-07 13:02:16,620 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:02:16,632 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-07 13:02:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:02:16,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:16,636 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:16,636 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-07 13:02:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:16,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73032904] [2022-04-07 13:02:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:16,779 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-07 13:02:16,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:16,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:16,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:16,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:16,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:16,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:16,797 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-07 13:02:16,797 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-07 13:02:16,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:16,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:16,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-07 13:02:16,798 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-07 13:02:16,798 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-07 13:02:16,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:16,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:16,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:16,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:16,799 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-07 13:02:16,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:16,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:16,799 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-07 13:02:16,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:02:16,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:02:16,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:02:16,800 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-07 13:02:16,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73032904] [2022-04-07 13:02:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73032904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:16,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:16,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:02:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703083890] [2022-04-07 13:02:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:16,806 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-07 13:02:16,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:16,809 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-07 13:02:16,835 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-07 13:02:16,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:02:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:02:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:16,862 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-07 13:02:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:20,274 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-07 13:02:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:02:20,275 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-07 13:02:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:20,276 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-07 13:02:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:20,292 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-07 13:02:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:20,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-07 13:02:20,415 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-07 13:02:20,422 INFO L225 Difference]: With dead ends: 70 [2022-04-07 13:02:20,422 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 13:02:20,425 INFO L912 BasicCegarLoop]: 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-07 13:02:20,427 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:20,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:02:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 13:02:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 13:02:20,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:20,452 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-07 13:02:20,453 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-07 13:02:20,453 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-07 13:02:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:20,457 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:20,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:20,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:20,458 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-07 13:02:20,458 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-07 13:02:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:20,461 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:20,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:20,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:20,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:20,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:20,462 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-07 13:02:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 13:02:20,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 13:02:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:20,465 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 13:02:20,465 INFO L479 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-07 13:02:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 13:02:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 13:02:20,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:20,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:20,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:02:20,467 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-07 13:02:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418486260] [2022-04-07 13:02:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:20,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:20,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361212775] [2022-04-07 13:02:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:20,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:20,483 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-07 13:02:20,484 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-07 13:02:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:20,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:02:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:20,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:20,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-07 13:02:20,707 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-07 13:02:20,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,709 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-07 13:02:20,709 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-07 13:02:20,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:20,711 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-07 13:02:20,712 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-07 13:02:20,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {275#false} is VALID [2022-04-07 13:02:20,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-07 13:02:20,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 10);havoc #t~post6; {275#false} is VALID [2022-04-07 13:02:20,713 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-07 13:02:20,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-07 13:02:20,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-07 13:02:20,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-07 13:02:20,714 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-07 13:02:20,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418486260] [2022-04-07 13:02:20,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361212775] [2022-04-07 13:02:20,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361212775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:20,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:20,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:02:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712908332] [2022-04-07 13:02:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:20,720 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-07 13:02:20,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:20,721 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-07 13:02:20,735 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-07 13:02:20,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:02:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:02:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:20,737 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-07 13:02:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:26,668 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-07 13:02:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:02:26,669 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-07 13:02:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:26,669 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-07 13:02:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:26,671 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-07 13:02:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:26,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 13:02:26,732 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-07 13:02:26,734 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:02:26,734 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 13:02:26,734 INFO L912 BasicCegarLoop]: 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-07 13:02:26,735 INFO L913 BasicCegarLoop]: 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-07 13:02:26,735 INFO L914 BasicCegarLoop]: 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-07 13:02:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 13:02:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 13:02:26,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:26,742 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-07 13:02:26,742 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-07 13:02:26,743 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-07 13:02:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:26,759 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:26,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:26,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:26,760 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-07 13:02:26,761 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-07 13:02:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:26,763 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:26,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:26,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:26,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:26,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:26,764 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-07 13:02:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 13:02:26,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 13:02:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:26,766 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 13:02:26,766 INFO L479 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-07 13:02:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:26,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:26,767 INFO L499 BasicCegarLoop]: 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-07 13:02:26,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 13:02:26,970 WARN L460 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-07 13:02:26,971 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-07 13:02:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:26,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840974602] [2022-04-07 13:02:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:27,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:27,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273197303] [2022-04-07 13:02:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:27,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:27,027 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-07 13:02:27,029 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-07 13:02:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:27,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-07 13:02:27,196 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; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~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; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:27,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:27,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:27,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:27,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-07 13:02:27,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {547#false} is VALID [2022-04-07 13:02:27,208 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#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)); {547#false} is VALID [2022-04-07 13:02:27,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-07 13:02:27,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-07 13:02:27,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-07 13:02:27,208 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-07 13:02:27,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840974602] [2022-04-07 13:02:27,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273197303] [2022-04-07 13:02:27,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273197303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:27,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:27,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:02:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655689729] [2022-04-07 13:02:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:27,210 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), 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 21 [2022-04-07 13:02:27,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:27,211 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), 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-07 13:02:27,229 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-07 13:02:27,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:02:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:27,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:02:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:27,230 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), 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-07 13:02:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:37,547 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-07 13:02:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:02:37,548 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), 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 21 [2022-04-07 13:02:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:37,548 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), 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-07 13:02:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:37,550 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), 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-07 13:02:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:37,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 13:02:37,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:37,603 INFO L225 Difference]: With dead ends: 49 [2022-04-07 13:02:37,603 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:02:37,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:37,604 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:37,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:02:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 13:02:37,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:37,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-07 13:02:37,612 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-07 13:02:37,612 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-07 13:02:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:37,614 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:37,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:37,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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 40 states. [2022-04-07 13:02:37,615 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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 40 states. [2022-04-07 13:02:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:37,617 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:37,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:37,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-07 13:02:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 13:02:37,620 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 13:02:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:37,620 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 13:02:37,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-07 13:02:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 13:02:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:37,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:37,621 INFO L499 BasicCegarLoop]: 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-07 13:02:37,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 13:02:37,821 WARN L460 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-07 13:02:37,822 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-07 13:02:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297817270] [2022-04-07 13:02:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:38,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(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; {822#true} is VALID [2022-04-07 13:02:38,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:38,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:38,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:38,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:38,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:38,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:38,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:38,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(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; {822#true} is VALID [2022-04-07 13:02:38,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:38,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:38,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-07 13:02:38,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-07 13:02:38,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-07 13:02:38,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:38,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:38,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:38,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:38,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:38,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:38,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:38,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:38,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:38,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:38,019 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:02:38,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:02:38,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-07 13:02:38,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-07 13:02:38,020 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-07 13:02:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:38,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297817270] [2022-04-07 13:02:38,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297817270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:38,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:38,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 13:02:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264590313] [2022-04-07 13:02:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:02:38,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:38,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:02:38,037 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-07 13:02:38,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 13:02:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 13:02:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:02:38,038 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:02:45,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:47,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:49,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:57,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:59,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:02,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:04,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:06,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:08,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:10,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:12,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:12,846 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-07 13:03:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:03:12,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:03:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:03:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-04-07 13:03:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:03:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-04-07 13:03:12,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-04-07 13:03:13,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:13,082 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:03:13,082 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 13:03:13,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:03:13,085 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:13,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 26.9s Time] [2022-04-07 13:03:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 13:03:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 13:03:13,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:13,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,128 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,128 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:13,130 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-07 13:03:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-07 13:03:13,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:13,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:13,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:13,132 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:13,134 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-07 13:03:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-07 13:03:13,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:13,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:13,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:13,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-07 13:03:13,137 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 21 [2022-04-07 13:03:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:13,137 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-07 13:03:13,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-07 13:03:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-07 13:03:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:03:13,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:13,138 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:13,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 13:03:13,138 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-07 13:03:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:13,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105490253] [2022-04-07 13:03:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:13,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:13,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968454396] [2022-04-07 13:03:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:13,155 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-07 13:03:13,160 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-07 13:03:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:13,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:03:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:13,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:13,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-07 13:03:13,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#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; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1118#(<= ~counter~0 0)} assume true; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1118#(<= ~counter~0 0)} {1110#true} #102#return; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {1118#(<= ~counter~0 0)} call #t~ret7 := main(); {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1118#(<= ~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; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {1118#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {1118#(<= ~counter~0 0)} ~cond := #in~cond; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {1118#(<= ~counter~0 0)} assume !(0 == ~cond); {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1118#(<= ~counter~0 0)} assume true; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1118#(<= ~counter~0 0)} {1118#(<= ~counter~0 0)} #82#return; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1118#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1118#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1152#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1152#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1152#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1162#(<= |main_#t~post5| 1)} is VALID [2022-04-07 13:03:13,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1162#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1111#false} is VALID [2022-04-07 13:03:13,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1111#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1111#false} is VALID [2022-04-07 13:03:13,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} assume !(#t~post6 < 10);havoc #t~post6; {1111#false} is VALID [2022-04-07 13:03:13,331 INFO L272 TraceCheckUtils]: 19: Hoare triple {1111#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)); {1111#false} is VALID [2022-04-07 13:03:13,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-07 13:03:13,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-07 13:03:13,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-07 13:03:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:13,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:13,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-04-07 13:03:13,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {1111#false} assume 0 == ~cond; {1111#false} is VALID [2022-04-07 13:03:13,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#false} ~cond := #in~cond; {1111#false} is VALID [2022-04-07 13:03:13,484 INFO L272 TraceCheckUtils]: 19: Hoare triple {1111#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)); {1111#false} is VALID [2022-04-07 13:03:13,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#false} assume !(#t~post6 < 10);havoc #t~post6; {1111#false} is VALID [2022-04-07 13:03:13,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1111#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1111#false} is VALID [2022-04-07 13:03:13,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1202#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1111#false} is VALID [2022-04-07 13:03:13,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1206#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1202#(< |main_#t~post5| 10)} is VALID [2022-04-07 13:03:13,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1206#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1206#(< ~counter~0 10)} is VALID [2022-04-07 13:03:13,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1206#(< ~counter~0 10)} is VALID [2022-04-07 13:03:13,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1206#(< ~counter~0 10)} is VALID [2022-04-07 13:03:13,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(< ~counter~0 9)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1110#true} {1216#(< ~counter~0 9)} #82#return; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-04-07 13:03:13,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-04-07 13:03:13,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-04-07 13:03:13,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {1216#(< ~counter~0 9)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1110#true} is VALID [2022-04-07 13:03:13,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1216#(< ~counter~0 9)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {1216#(< ~counter~0 9)} call #t~ret7 := main(); {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1216#(< ~counter~0 9)} {1110#true} #102#return; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1216#(< ~counter~0 9)} assume true; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#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; {1216#(< ~counter~0 9)} is VALID [2022-04-07 13:03:13,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {1110#true} call ULTIMATE.init(); {1110#true} is VALID [2022-04-07 13:03:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105490253] [2022-04-07 13:03:13,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:13,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968454396] [2022-04-07 13:03:13,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968454396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:13,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:13,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:03:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143283995] [2022-04-07 13:03:13,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:13,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:13,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:13,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:03:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:03:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:03:13,518 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:33,150 INFO L93 Difference]: Finished difference Result 105 states and 149 transitions. [2022-04-07 13:03:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:03:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2022-04-07 13:03:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2022-04-07 13:03:33,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 146 transitions. [2022-04-07 13:03:33,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:33,282 INFO L225 Difference]: With dead ends: 105 [2022-04-07 13:03:33,283 INFO L226 Difference]: Without dead ends: 86 [2022-04-07 13:03:33,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:03:33,283 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 78 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:33,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 243 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-07 13:03:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-07 13:03:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-04-07 13:03:33,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:33,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:33,302 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:33,302 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:33,305 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2022-04-07 13:03:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2022-04-07 13:03:33,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:33,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:33,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 86 states. [2022-04-07 13:03:33,306 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 86 states. [2022-04-07 13:03:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:33,310 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2022-04-07 13:03:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2022-04-07 13:03:33,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:33,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:33,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:33,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-04-07 13:03:33,314 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 23 [2022-04-07 13:03:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:33,314 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-04-07 13:03:33,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2022-04-07 13:03:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:33,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:33,315 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:33,337 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-07 13:03:33,535 WARN L460 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-07 13:03:33,536 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-07 13:03:33,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:33,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412814342] [2022-04-07 13:03:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:33,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900811317] [2022-04-07 13:03:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:33,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:33,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:33,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:03:33,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 13:03:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:33,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:03:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:33,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:33,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2022-04-07 13:03:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1681#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; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1689#(<= ~counter~0 0)} assume true; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1689#(<= ~counter~0 0)} {1681#true} #102#return; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {1689#(<= ~counter~0 0)} call #t~ret7 := main(); {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1689#(<= ~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; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1689#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1689#(<= ~counter~0 0)} ~cond := #in~cond; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1689#(<= ~counter~0 0)} assume !(0 == ~cond); {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1689#(<= ~counter~0 0)} assume true; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1689#(<= ~counter~0 0)} {1689#(<= ~counter~0 0)} #82#return; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1689#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1689#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:33,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1723#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:33,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1723#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1723#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:33,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {1723#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1723#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:33,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1733#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:33,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1733#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1733#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:33,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {1733#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1733#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:33,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {1733#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1743#(<= |main_#t~post6| 2)} is VALID [2022-04-07 13:03:33,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {1743#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1682#false} is VALID [2022-04-07 13:03:33,775 INFO L272 TraceCheckUtils]: 20: Hoare triple {1682#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)); {1682#false} is VALID [2022-04-07 13:03:33,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2022-04-07 13:03:33,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2022-04-07 13:03:33,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2022-04-07 13:03:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:33,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:33,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2022-04-07 13:03:33,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2022-04-07 13:03:33,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2022-04-07 13:03:33,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {1682#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)); {1682#false} is VALID [2022-04-07 13:03:33,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1682#false} is VALID [2022-04-07 13:03:33,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1771#(< |main_#t~post6| 10)} is VALID [2022-04-07 13:03:33,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(< ~counter~0 10)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(< ~counter~0 10)} is VALID [2022-04-07 13:03:33,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1775#(< ~counter~0 10)} is VALID [2022-04-07 13:03:33,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(< ~counter~0 10)} is VALID [2022-04-07 13:03:33,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1785#(< ~counter~0 9)} is VALID [2022-04-07 13:03:33,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {1785#(< ~counter~0 9)} is VALID [2022-04-07 13:03:33,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1795#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1785#(< ~counter~0 9)} is VALID [2022-04-07 13:03:33,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1795#(< ~counter~0 8)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1681#true} {1795#(< ~counter~0 8)} #82#return; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#true} assume true; {1681#true} is VALID [2022-04-07 13:03:33,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1681#true} assume !(0 == ~cond); {1681#true} is VALID [2022-04-07 13:03:33,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1681#true} ~cond := #in~cond; {1681#true} is VALID [2022-04-07 13:03:33,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {1795#(< ~counter~0 8)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1681#true} is VALID [2022-04-07 13:03:33,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#(< ~counter~0 8)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1795#(< ~counter~0 8)} call #t~ret7 := main(); {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1795#(< ~counter~0 8)} {1681#true} #102#return; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1795#(< ~counter~0 8)} assume true; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1681#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; {1795#(< ~counter~0 8)} is VALID [2022-04-07 13:03:33,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2022-04-07 13:03:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:33,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:33,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412814342] [2022-04-07 13:03:33,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:33,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900811317] [2022-04-07 13:03:33,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900811317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:33,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:33,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 13:03:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148815491] [2022-04-07 13:03:33,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:33,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:03:33,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:33,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:33,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:33,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 13:03:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 13:03:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 13:03:33,986 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:36,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:39,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:41,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:44,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:46,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:03,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:05,696 INFO L93 Difference]: Finished difference Result 139 states and 195 transitions. [2022-04-07 13:04:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:04:05,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:04:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2022-04-07 13:04:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2022-04-07 13:04:05,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 192 transitions. [2022-04-07 13:04:05,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:05,884 INFO L225 Difference]: With dead ends: 139 [2022-04-07 13:04:05,884 INFO L226 Difference]: Without dead ends: 130 [2022-04-07 13:04:05,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-07 13:04:05,885 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:05,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 281 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 17.6s Time] [2022-04-07 13:04:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-07 13:04:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-04-07 13:04:05,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:05,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:05,936 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:05,936 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:05,941 INFO L93 Difference]: Finished difference Result 130 states and 181 transitions. [2022-04-07 13:04:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2022-04-07 13:04:05,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:05,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:05,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 130 states. [2022-04-07 13:04:05,944 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 130 states. [2022-04-07 13:04:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:05,950 INFO L93 Difference]: Finished difference Result 130 states and 181 transitions. [2022-04-07 13:04:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2022-04-07 13:04:05,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:05,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:05,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:05,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 71 states have internal predecessors, (90), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2022-04-07 13:04:05,956 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 24 [2022-04-07 13:04:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:05,956 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2022-04-07 13:04:05,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2022-04-07 13:04:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:04:05,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:05,957 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:05,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:06,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:06,174 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-07 13:04:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:06,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519793250] [2022-04-07 13:04:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:04:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:06,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {2503#(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; {2489#true} is VALID [2022-04-07 13:04:06,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2489#true} {2489#true} #102#return; {2489#true} is VALID [2022-04-07 13:04:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:04:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:06,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {2489#true} ~cond := #in~cond; {2489#true} is VALID [2022-04-07 13:04:06,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#true} assume !(0 == ~cond); {2489#true} is VALID [2022-04-07 13:04:06,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} #82#return; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {2489#true} call ULTIMATE.init(); {2503#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {2503#(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; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} #102#return; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {2489#true} call #t~ret7 := main(); {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {2489#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#true} ~cond := #in~cond; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#true} assume !(0 == ~cond); {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2489#true} {2489#true} #82#return; {2489#true} is VALID [2022-04-07 13:04:06,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:06,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:06,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:06,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:06,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:06,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:06,395 INFO L272 TraceCheckUtils]: 20: Hoare triple {2500#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:06,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {2501#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2502#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:04:06,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {2502#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2490#false} is VALID [2022-04-07 13:04:06,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-04-07 13:04:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519793250] [2022-04-07 13:04:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519793250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:04:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766428633] [2022-04-07 13:04:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:06,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:06,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:06,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 13:04:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:06,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:04:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:06,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:06,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2489#true} call ULTIMATE.init(); {2489#true} is VALID [2022-04-07 13:04:06,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#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; {2489#true} is VALID [2022-04-07 13:04:06,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} #102#return; {2489#true} is VALID [2022-04-07 13:04:06,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {2489#true} call #t~ret7 := main(); {2489#true} is VALID [2022-04-07 13:04:06,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {2489#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#true} ~cond := #in~cond; {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#true} assume !(0 == ~cond); {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2489#true} {2489#true} #82#return; {2489#true} is VALID [2022-04-07 13:04:06,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {2498#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:06,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {2549#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:06,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:06,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 10);havoc #t~post6; {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:06,826 INFO L272 TraceCheckUtils]: 20: Hoare triple {2559#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:06,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:06,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {2573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2490#false} is VALID [2022-04-07 13:04:06,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-04-07 13:04:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:06,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:04:07,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {2490#false} assume !false; {2490#false} is VALID [2022-04-07 13:04:07,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {2573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2490#false} is VALID [2022-04-07 13:04:07,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:07,112 INFO L272 TraceCheckUtils]: 20: Hoare triple {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:07,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 10);havoc #t~post6; {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:07,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:07,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2589#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:07,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 10);havoc #t~post5; {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:07,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:07,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2599#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:07,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 10);havoc #t~post5; {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:07,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:07,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2609#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:07,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2489#true} {2489#true} #82#return; {2489#true} is VALID [2022-04-07 13:04:07,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:07,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#true} assume !(0 == ~cond); {2489#true} is VALID [2022-04-07 13:04:07,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#true} ~cond := #in~cond; {2489#true} is VALID [2022-04-07 13:04:07,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {2489#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {2489#true} call #t~ret7 := main(); {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2489#true} {2489#true} #102#return; {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {2489#true} assume true; {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {2489#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; {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {2489#true} call ULTIMATE.init(); {2489#true} is VALID [2022-04-07 13:04:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:07,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766428633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:04:07,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:04:07,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-07 13:04:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652696221] [2022-04-07 13:04:07,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:04:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:04:07,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:07,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:07,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:07,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:04:07,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:04:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:04:07,172 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:12,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:14,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:19,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:22,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:24,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:27,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:30,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:32,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:34,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:36,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:38,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:40,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:43,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:45,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:47,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:49,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:07,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:16,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:34,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:40,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:50,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:52,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:56,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:57,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:01,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:03,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:06,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:11,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:11,224 INFO L93 Difference]: Finished difference Result 271 states and 413 transitions. [2022-04-07 13:06:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 13:06:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:06:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2022-04-07 13:06:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2022-04-07 13:06:11,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 188 transitions. [2022-04-07 13:06:16,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 186 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:16,298 INFO L225 Difference]: With dead ends: 271 [2022-04-07 13:06:16,298 INFO L226 Difference]: Without dead ends: 190 [2022-04-07 13:06:16,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-07 13:06:16,299 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 176 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:16,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 160 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 576 Invalid, 23 Unknown, 0 Unchecked, 75.0s Time] [2022-04-07 13:06:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-07 13:06:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2022-04-07 13:06:16,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:16,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:16,367 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:16,368 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:16,373 INFO L93 Difference]: Finished difference Result 190 states and 277 transitions. [2022-04-07 13:06:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2022-04-07 13:06:16,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:16,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:16,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 190 states. [2022-04-07 13:06:16,375 INFO L87 Difference]: Start difference. First operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 190 states. [2022-04-07 13:06:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:16,380 INFO L93 Difference]: Finished difference Result 190 states and 277 transitions. [2022-04-07 13:06:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2022-04-07 13:06:16,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:16,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:16,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:16,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2022-04-07 13:06:16,386 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 24 [2022-04-07 13:06:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:16,386 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2022-04-07 13:06:16,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2022-04-07 13:06:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 13:06:16,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:16,387 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 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-07 13:06:16,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:16,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:16,603 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-07 13:06:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784694606] [2022-04-07 13:06:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:16,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:16,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981712104] [2022-04-07 13:06:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:16,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:16,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 13:06:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:16,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:06:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:16,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:16,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3720#true} is VALID [2022-04-07 13:06:16,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#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; {3720#true} is VALID [2022-04-07 13:06:16,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 13:06:16,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #102#return; {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret7 := main(); {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {3720#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3720#true} {3720#true} #82#return; {3720#true} is VALID [2022-04-07 13:06:16,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {3720#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,854 INFO L272 TraceCheckUtils]: 17: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3720#true} is VALID [2022-04-07 13:06:16,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 13:06:16,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 13:06:16,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 13:06:16,854 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3720#true} {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,855 INFO L272 TraceCheckUtils]: 22: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3720#true} is VALID [2022-04-07 13:06:16,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {3720#true} ~cond := #in~cond; {3720#true} is VALID [2022-04-07 13:06:16,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {3720#true} assume !(0 == ~cond); {3720#true} is VALID [2022-04-07 13:06:16,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-07 13:06:16,855 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3720#true} {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:16,856 INFO L272 TraceCheckUtils]: 27: Hoare triple {3758#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:06:16,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {3807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:06:16,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {3811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3721#false} is VALID [2022-04-07 13:06:16,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-07 13:06:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:06:16,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:06:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784694606] [2022-04-07 13:06:16,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981712104] [2022-04-07 13:06:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981712104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:06:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:06:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:06:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537344912] [2022-04-07 13:06:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:06:16,860 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:06:16,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:16,860 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:16,880 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-07 13:06:16,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:06:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:06:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:06:16,880 INFO L87 Difference]: Start difference. First operand 170 states and 240 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:20,939 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2022-04-07 13:06:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:06:20,940 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:06:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:20,940 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:06:20,941 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:06:20,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-07 13:06:21,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:21,012 INFO L225 Difference]: With dead ends: 176 [2022-04-07 13:06:21,012 INFO L226 Difference]: Without dead ends: 152 [2022-04-07 13:06:21,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-07 13:06:21,013 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:21,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 13:06:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-07 13:06:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-07 13:06:21,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:21,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:21,069 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:21,070 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:21,075 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:06:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:06:21,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:21,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:21,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:06:21,078 INFO L87 Difference]: Start difference. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:06:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:21,082 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:06:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:06:21,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:21,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:21,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:21,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-07 13:06:21,087 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-07 13:06:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:21,087 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-07 13:06:21,087 INFO L479 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:06:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 13:06:21,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:21,089 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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-07 13:06:21,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:21,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:21,295 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-07 13:06:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:21,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761224747] [2022-04-07 13:06:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:21,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:21,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267027314] [2022-04-07 13:06:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:21,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:21,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 13:06:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:21,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:06:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:21,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:21,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {4611#true} call ULTIMATE.init(); {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {4611#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; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {4611#true} assume true; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4611#true} {4611#true} #102#return; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {4611#true} call #t~ret7 := main(); {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4611#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {4611#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4611#true} ~cond := #in~cond; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4611#true} assume !(0 == ~cond); {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4611#true} assume true; {4611#true} is VALID [2022-04-07 13:06:21,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4611#true} {4611#true} #82#return; {4611#true} is VALID [2022-04-07 13:06:21,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {4611#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,562 INFO L272 TraceCheckUtils]: 20: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {4611#true} ~cond := #in~cond; {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {4611#true} assume !(0 == ~cond); {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {4611#true} assume true; {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4611#true} {4649#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,563 INFO L272 TraceCheckUtils]: 25: Hoare triple {4649#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {4611#true} ~cond := #in~cond; {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {4611#true} assume !(0 == ~cond); {4611#true} is VALID [2022-04-07 13:06:21,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {4611#true} assume true; {4611#true} is VALID [2022-04-07 13:06:21,564 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4611#true} {4649#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4649#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:21,565 INFO L272 TraceCheckUtils]: 30: Hoare triple {4649#(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 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:06:21,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {4707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:06:21,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {4711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4612#false} is VALID [2022-04-07 13:06:21,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {4612#false} assume !false; {4612#false} is VALID [2022-04-07 13:06:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:06:21,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:06:21,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:21,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761224747] [2022-04-07 13:06:21,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:21,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267027314] [2022-04-07 13:06:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267027314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:06:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:06:21,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:06:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246877631] [2022-04-07 13:06:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:06:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:06:21,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:21,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:21,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:21,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:06:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:06:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:06:21,601 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:27,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:30,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:30,352 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-07 13:06:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:06:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:06:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:06:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:06:30,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:06:30,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:30,444 INFO L225 Difference]: With dead ends: 182 [2022-04-07 13:06:30,444 INFO L226 Difference]: Without dead ends: 177 [2022-04-07 13:06:30,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-07 13:06:30,445 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:30,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-07 13:06:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-07 13:06:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-07 13:06:30,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:30,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:30,502 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:30,502 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:30,506 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:06:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:06:30,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:30,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:30,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:06:30,507 INFO L87 Difference]: Start difference. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:06:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:30,511 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:06:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:06:30,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:30,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:30,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:30,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-07 13:06:30,515 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-07 13:06:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:30,515 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-07 13:06:30,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-07 13:06:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 13:06:30,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:30,516 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:30,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:30,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:30,722 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-07 13:06:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:30,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678935189] [2022-04-07 13:06:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:06:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:30,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {5600#(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; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5590#(<= ~counter~0 0)} {5585#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:06:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:30,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {5585#true} ~cond := #in~cond; {5585#true} is VALID [2022-04-07 13:06:30,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {5585#true} assume !(0 == ~cond); {5585#true} is VALID [2022-04-07 13:06:30,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {5585#true} assume true; {5585#true} is VALID [2022-04-07 13:06:30,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5585#true} {5590#(<= ~counter~0 0)} #82#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {5585#true} call ULTIMATE.init(); {5600#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:06:30,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {5600#(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; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5585#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret7 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~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; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5585#true} is VALID [2022-04-07 13:06:30,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {5585#true} ~cond := #in~cond; {5585#true} is VALID [2022-04-07 13:06:30,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {5585#true} assume !(0 == ~cond); {5585#true} is VALID [2022-04-07 13:06:30,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {5585#true} assume true; {5585#true} is VALID [2022-04-07 13:06:30,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5585#true} {5590#(<= ~counter~0 0)} #82#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:30,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:30,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {5595#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:30,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {5595#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:30,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {5595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:30,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {5596#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:30,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {5596#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:30,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {5596#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:30,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {5597#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:30,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {5597#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:30,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {5597#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:30,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:30,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:30,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {5598#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5599#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:06:30,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5586#false} is VALID [2022-04-07 13:06:30,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {5586#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5586#false} is VALID [2022-04-07 13:06:30,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {5586#false} assume !!(#t~post6 < 10);havoc #t~post6; {5586#false} is VALID [2022-04-07 13:06:30,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {5586#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5586#false} is VALID [2022-04-07 13:06:30,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {5586#false} ~cond := #in~cond; {5586#false} is VALID [2022-04-07 13:06:30,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {5586#false} assume 0 == ~cond; {5586#false} is VALID [2022-04-07 13:06:30,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {5586#false} assume !false; {5586#false} is VALID [2022-04-07 13:06:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678935189] [2022-04-07 13:06:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678935189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:06:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829525608] [2022-04-07 13:06:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:30,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:30,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 13:06:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:30,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 13:06:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:30,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:31,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {5585#true} call ULTIMATE.init(); {5585#true} is VALID [2022-04-07 13:06:31,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {5585#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; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5585#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret7 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~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; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #82#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:31,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:31,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {5595#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:31,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {5595#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5595#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:31,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {5595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:31,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {5596#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:31,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {5596#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5596#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:31,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {5596#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:31,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {5597#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:31,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {5597#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5597#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:31,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {5597#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:31,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:31,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5598#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {5598#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5599#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5586#false} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {5586#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5586#false} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {5586#false} assume !!(#t~post6 < 10);havoc #t~post6; {5586#false} is VALID [2022-04-07 13:06:31,117 INFO L272 TraceCheckUtils]: 28: Hoare triple {5586#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5586#false} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {5586#false} ~cond := #in~cond; {5586#false} is VALID [2022-04-07 13:06:31,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {5586#false} assume 0 == ~cond; {5586#false} is VALID [2022-04-07 13:06:31,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {5586#false} assume !false; {5586#false} is VALID [2022-04-07 13:06:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:31,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:06:31,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {5586#false} assume !false; {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {5586#false} assume 0 == ~cond; {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {5586#false} ~cond := #in~cond; {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {5586#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {5586#false} assume !!(#t~post6 < 10);havoc #t~post6; {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {5586#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5586#false} is VALID [2022-04-07 13:06:31,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {5715#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5586#false} is VALID [2022-04-07 13:06:31,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {5719#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5715#(< |main_#t~post5| 10)} is VALID [2022-04-07 13:06:31,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {5719#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5719#(< ~counter~0 10)} is VALID [2022-04-07 13:06:31,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {5719#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5719#(< ~counter~0 10)} is VALID [2022-04-07 13:06:31,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {5729#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5719#(< ~counter~0 10)} is VALID [2022-04-07 13:06:31,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {5729#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5729#(< ~counter~0 9)} is VALID [2022-04-07 13:06:31,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {5729#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5729#(< ~counter~0 9)} is VALID [2022-04-07 13:06:31,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {5739#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5729#(< ~counter~0 9)} is VALID [2022-04-07 13:06:31,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {5739#(< ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5739#(< ~counter~0 8)} is VALID [2022-04-07 13:06:31,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {5739#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5739#(< ~counter~0 8)} is VALID [2022-04-07 13:06:31,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {5749#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5739#(< ~counter~0 8)} is VALID [2022-04-07 13:06:31,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {5749#(< ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5749#(< ~counter~0 7)} is VALID [2022-04-07 13:06:31,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {5749#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5749#(< ~counter~0 7)} is VALID [2022-04-07 13:06:31,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {5759#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5749#(< ~counter~0 7)} is VALID [2022-04-07 13:06:31,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {5759#(< ~counter~0 6)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5585#true} {5759#(< ~counter~0 6)} #82#return; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {5585#true} assume true; {5585#true} is VALID [2022-04-07 13:06:31,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {5585#true} assume !(0 == ~cond); {5585#true} is VALID [2022-04-07 13:06:31,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {5585#true} ~cond := #in~cond; {5585#true} is VALID [2022-04-07 13:06:31,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {5759#(< ~counter~0 6)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5585#true} is VALID [2022-04-07 13:06:31,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {5759#(< ~counter~0 6)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {5759#(< ~counter~0 6)} call #t~ret7 := main(); {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5759#(< ~counter~0 6)} {5585#true} #102#return; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {5759#(< ~counter~0 6)} assume true; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {5585#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; {5759#(< ~counter~0 6)} is VALID [2022-04-07 13:06:31,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {5585#true} call ULTIMATE.init(); {5585#true} is VALID [2022-04-07 13:06:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829525608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:06:31,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:06:31,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 13:06:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71637558] [2022-04-07 13:06:31,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:06:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:06:31,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:31,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:31,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:31,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:06:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:06:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:06:31,429 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:45,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:47,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:49,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:52,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:54,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:56,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []