/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_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:19:19,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:19:19,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:19:19,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:19:19,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:19:19,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:19:19,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:19:19,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:19:19,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:19:19,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:19:19,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:19:19,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:19:19,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:19:19,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:19:19,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:19:19,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:19:19,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:19:19,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:19:19,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:19:19,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:19:19,394 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:19:19,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:19:19,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:19:19,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:19:19,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:19:19,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:19:19,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:19:19,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:19:19,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:19:19,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:19:19,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:19:19,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:19:19,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:19:19,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:19:19,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:19:19,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:19:19,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:19:19,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:19:19,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:19:19,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:19:19,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:19:19,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:19:19,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:19:19,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:19:19,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:19:19,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:19:19,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:19:19,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:19:19,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:19:19,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:19:19,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:19:19,439 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:19:19,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:19:19,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:19:19,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:19:19,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:19:19,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:19:19,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:19:19,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:19,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:19:19,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:19:19,443 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:19:19,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:19:19,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:19:19,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:19:19,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:19:19,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:19:19,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:19:19,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:19:19,680 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:19:19,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-04-27 12:19:19,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0ee6957/510928ca047946de88623b7946a89a9a/FLAG80ada77f0 [2022-04-27 12:19:20,067 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:19:20,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-04-27 12:19:20,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0ee6957/510928ca047946de88623b7946a89a9a/FLAG80ada77f0 [2022-04-27 12:19:20,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0ee6957/510928ca047946de88623b7946a89a9a [2022-04-27 12:19:20,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:19:20,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:19:20,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:20,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:19:20,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:19:20,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3beaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20, skipping insertion in model container [2022-04-27 12:19:20,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:19:20,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:19:20,687 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_valuebound50.c[525,538] [2022-04-27 12:19:20,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:20,726 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:19:20,734 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_valuebound50.c[525,538] [2022-04-27 12:19:20,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:20,758 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:19:20,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20 WrapperNode [2022-04-27 12:19:20,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:20,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:19:20,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:19:20,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:19:20,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:19:20,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:19:20,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:19:20,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:19:20,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (1/1) ... [2022-04-27 12:19:20,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:20,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:19:20,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:19:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:19:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:19:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:19:20,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:19:20,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:19:20,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:19:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:19:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:19:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:19:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:19:20,893 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:19:20,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:19:21,103 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:19:21,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:19:21,123 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:19:21,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:21 BoogieIcfgContainer [2022-04-27 12:19:21,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:19:21,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:19:21,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:19:21,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:19:21,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:19:20" (1/3) ... [2022-04-27 12:19:21,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16208e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:21, skipping insertion in model container [2022-04-27 12:19:21,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:20" (2/3) ... [2022-04-27 12:19:21,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16208e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:21, skipping insertion in model container [2022-04-27 12:19:21,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:21" (3/3) ... [2022-04-27 12:19:21,130 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2022-04-27 12:19:21,140 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:19:21,140 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:19:21,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:19:21,174 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@767d7b4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e059b16 [2022-04-27 12:19:21,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:19:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:19:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:19:21,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:21,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:21,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-27 12:19:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:21,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563359325] [2022-04-27 12:19:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:21,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#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); {41#true} is VALID [2022-04-27 12:19:21,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:19:21,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:19:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:21,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:19:21,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:19:21,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:19:21,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:19:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:19:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:21,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:19:21,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:19:21,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:19:21,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:19:21,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:21,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#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); {41#true} is VALID [2022-04-27 12:19:21,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:19:21,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:19:21,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-27 12:19:21,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-27 12:19:21,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-27 12:19:21,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:19:21,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:19:21,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:19:21,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:19:21,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-27 12:19:21,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:19:21,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:19:21,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:19:21,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:19:21,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-27 12:19:21,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:19:21,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:19:21,414 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#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)); {42#false} is VALID [2022-04-27 12:19:21,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 12:19:21,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 12:19:21,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 12:19:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:19:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:21,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563359325] [2022-04-27 12:19:21,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563359325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:21,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:21,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:19:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533398361] [2022-04-27 12:19:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:21,421 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:19:21,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:21,425 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:19:21,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:19:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:21,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:19:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:19:21,479 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:19:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:22,933 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-27 12:19:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:19:22,951 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:19:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:22,953 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:19:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:19:22,976 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:19:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:19:22,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-27 12:19:23,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:23,121 INFO L225 Difference]: With dead ends: 69 [2022-04-27 12:19:23,121 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 12:19:23,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:19:23,125 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 12:19:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 12:19:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 12:19:23,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:23,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:19:23,145 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:19:23,146 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:19:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:23,149 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:19:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:19:23,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:23,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:19:23,150 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:19:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:23,153 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:19:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:19:23,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:23,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:23,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:23,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:19:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 12:19:23,166 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 12:19:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:23,166 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 12:19:23,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:19:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:19:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:23,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:23,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:23,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:19:23,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-27 12:19:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:23,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025133260] [2022-04-27 12:19:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:23,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(and (= |#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); {274#true} is VALID [2022-04-27 12:19:23,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:19:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:23,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:19:23,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:19:23,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:19:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:19:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:23,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:19:23,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:19:23,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:19:23,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:23,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(and (= |#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); {274#true} is VALID [2022-04-27 12:19:23,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:19:23,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-27 12:19:23,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {274#true} is VALID [2022-04-27 12:19:23,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {274#true} is VALID [2022-04-27 12:19:23,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:19:23,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:19:23,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:19:23,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {274#true} is VALID [2022-04-27 12:19:23,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:19:23,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:19:23,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:19:23,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:19:23,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:23,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:23,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {288#(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-27 12:19:23,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(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 !false; {288#(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-27 12:19:23,339 INFO L272 TraceCheckUtils]: 20: Hoare triple {288#(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)); {289#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:19:23,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {289#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {290#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:19:23,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:19:23,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:19:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:19:23,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:23,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025133260] [2022-04-27 12:19:23,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025133260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:23,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:23,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:19:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294045339] [2022-04-27 12:19:23,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:19:23,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:23,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:23,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:23,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:19:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:19:23,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:19:23,358 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:35,540 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-27 12:19:37,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:39,884 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-27 12:19:41,958 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-27 12:19:46,517 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-27 12:19:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,588 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-27 12:19:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:19:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:19:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:19:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:19:48,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-27 12:19:48,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:48,788 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:19:48,788 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:19:48,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:19:48,790 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 52 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:48,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 53 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 194 Invalid, 5 Unknown, 0 Unchecked, 16.1s Time] [2022-04-27 12:19:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:19:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 12:19:48,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:48,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:48,804 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:48,804 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,807 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:19:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:19:48,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:48,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:48,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:19:48,809 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:19:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,811 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:19:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:19:48,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:48,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:48,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:48,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 12:19:48,815 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 12:19:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:48,815 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 12:19:48,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:19:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:19:48,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:48,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:48,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:19:48,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-27 12:19:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:48,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090269572] [2022-04-27 12:19:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:48,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#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); {582#true} is VALID [2022-04-27 12:19:48,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:48,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:19:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:49,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:19:49,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:19:49,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:49,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:19:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:19:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:49,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:19:49,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:19:49,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:49,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:19:49,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:49,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#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); {582#true} is VALID [2022-04-27 12:19:49,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-27 12:19:49,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {582#true} is VALID [2022-04-27 12:19:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:19:49,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:19:49,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {582#true} is VALID [2022-04-27 12:19:49,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:19:49,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:19:49,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:19:49,007 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:19:49,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:49,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:49,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:49,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:49,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {596#(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-27 12:19:49,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {596#(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 !false; {596#(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-27 12:19:49,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#(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)); {597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:19:49,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {597#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:19:49,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {583#false} is VALID [2022-04-27 12:19:49,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-27 12:19:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 12:19:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:49,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090269572] [2022-04-27 12:19:49,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090269572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:49,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:49,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:19:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984583002] [2022-04-27 12:19:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:19:49,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:49,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:49,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:49,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:19:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:49,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:19:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:19:49,029 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:54,446 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-27 12:19:56,545 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-27 12:20:00,703 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-27 12:20:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:05,742 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-04-27 12:20:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:20:05,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:20:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:20:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 12:20:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:20:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 12:20:05,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-27 12:20:06,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:06,123 INFO L225 Difference]: With dead ends: 77 [2022-04-27 12:20:06,123 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 12:20:06,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:20:06,124 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 78 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:06,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 10.2s Time] [2022-04-27 12:20:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 12:20:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-27 12:20:06,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:06,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:20:06,157 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:20:06,157 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:20:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:06,164 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 12:20:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 12:20:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:06,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:06,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:20:06,170 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:20:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:06,173 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 12:20:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 12:20:06,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:06,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:06,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:06,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:20:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-27 12:20:06,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-27 12:20:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:06,182 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-27 12:20:06,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:20:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-27 12:20:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:20:06,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:06,183 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2022-04-27 12:20:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 12:20:06,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-27 12:20:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115679933] [2022-04-27 12:20:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:06,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:06,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918372458] [2022-04-27 12:20:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:06,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:06,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:06,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:20:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:06,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:20:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:06,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:06,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2022-04-27 12:20:06,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#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); {975#true} is VALID [2022-04-27 12:20:06,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:20:06,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #103#return; {975#true} is VALID [2022-04-27 12:20:06,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret5 := main(); {975#true} is VALID [2022-04-27 12:20:06,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {975#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {975#true} is VALID [2022-04-27 12:20:06,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {975#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:20:06,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {975#true} {975#true} #81#return; {975#true} is VALID [2022-04-27 12:20:06,567 INFO L272 TraceCheckUtils]: 11: Hoare triple {975#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:20:06,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:20:06,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {975#true} {975#true} #83#return; {975#true} is VALID [2022-04-27 12:20:06,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {975#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,582 INFO L272 TraceCheckUtils]: 20: Hoare triple {1028#(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)); {975#true} is VALID [2022-04-27 12:20:06,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:20:06,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:20:06,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:20:06,583 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,584 INFO L272 TraceCheckUtils]: 25: Hoare triple {1028#(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)); {975#true} is VALID [2022-04-27 12:20:06,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:20:06,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:20:06,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:20:06,584 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:06,585 INFO L272 TraceCheckUtils]: 30: Hoare triple {1028#(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)); {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:06,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1075#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:06,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {1075#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {976#false} is VALID [2022-04-27 12:20:06,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {976#false} assume !false; {976#false} is VALID [2022-04-27 12:20:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:20:06,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:06,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115679933] [2022-04-27 12:20:06,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918372458] [2022-04-27 12:20:06,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918372458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:06,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:06,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636337092] [2022-04-27 12:20:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:20:06,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:06,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:06,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:06,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:06,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:06,617 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:11,009 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-27 12:20:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:12,463 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-27 12:20:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:20:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:20:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:20:12,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:20:12,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:12,529 INFO L225 Difference]: With dead ends: 74 [2022-04-27 12:20:12,529 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:20:12,529 INFO L412 NwaCegarLoop]: 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-27 12:20:12,530 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:12,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 12:20:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:20:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:20:12,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:12,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:20:12,540 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:20:12,541 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:20:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:12,546 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:20:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:20:12,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:12,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:12,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 12:20:12,547 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 12:20:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:12,549 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:20:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:20:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:12,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:12,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:12,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:20:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-27 12:20:12,551 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-27 12:20:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:12,551 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-27 12:20:12,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:20:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:20:12,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:12,552 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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] [2022-04-27 12:20:12,561 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-27 12:20:12,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:12,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-27 12:20:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386363859] [2022-04-27 12:20:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:12,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816260216] [2022-04-27 12:20:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:12,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:12,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:20:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:12,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:20:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:12,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:13,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} call ULTIMATE.init(); {1376#true} is VALID [2022-04-27 12:20:13,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#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); {1376#true} is VALID [2022-04-27 12:20:13,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:20:13,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} #103#return; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} call #t~ret5 := main(); {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {1376#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 50 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1376#true} {1376#true} #81#return; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L272 TraceCheckUtils]: 11: Hoare triple {1376#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:20:13,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:20:13,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#true} {1376#true} #83#return; {1376#true} is VALID [2022-04-27 12:20:13,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,076 INFO L272 TraceCheckUtils]: 22: Hoare triple {1429#(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)); {1376#true} is VALID [2022-04-27 12:20:13,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:20:13,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:20:13,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:20:13,077 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,077 INFO L272 TraceCheckUtils]: 27: Hoare triple {1429#(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)); {1376#true} is VALID [2022-04-27 12:20:13,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:20:13,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:20:13,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:20:13,078 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:13,079 INFO L272 TraceCheckUtils]: 32: Hoare triple {1429#(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)); {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:13,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:13,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1377#false} is VALID [2022-04-27 12:20:13,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-04-27 12:20:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 12:20:13,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:13,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386363859] [2022-04-27 12:20:13,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:13,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816260216] [2022-04-27 12:20:13,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816260216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:13,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:13,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456148814] [2022-04-27 12:20:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:20:13,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:13,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:13,116 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-27 12:20:13,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:13,117 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:20,091 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-27 12:20:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:20:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:20:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:20:20,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 12:20:20,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:20,164 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:20:20,164 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 12:20:20,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:20:20,165 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:20,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 12:20:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 12:20:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 12:20:20,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:20,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:20:20,215 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:20:20,216 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:20:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:20,218 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 12:20:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:20:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:20,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 12:20:20,219 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 12:20:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:20,227 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 12:20:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:20:20,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:20,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:20,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:20,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:20:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-27 12:20:20,230 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-27 12:20:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:20,230 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-27 12:20:20,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:20:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:20:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 12:20:20,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:20,235 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 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, 1, 1, 1, 1, 1] [2022-04-27 12:20:20,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:20,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:20,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-27 12:20:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786384780] [2022-04-27 12:20:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:20,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:20,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55938950] [2022-04-27 12:20:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:20,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:20,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process