/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:16:40,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:16:40,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:16:40,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:16:40,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:16:40,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:16:40,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:16:40,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:16:40,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:16:40,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:16:40,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:16:40,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:16:40,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:16:40,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:16:40,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:16:40,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:16:40,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:16:40,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:16:40,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:16:40,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:16:40,652 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:16:40,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:16:40,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:16:40,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:16:40,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:16:40,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:16:40,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:16:40,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:16:40,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:16:40,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:16:40,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:16:40,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:16:40,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:16:40,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:16:40,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:16:40,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:16:40,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:16:40,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:16:40,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:16:40,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:16:40,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:16:40,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:16:40,662 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-14 15:16:40,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:16:40,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:16:40,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:16:40,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:16:40,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:16:40,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:16:40,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:16:40,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:16:40,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:16:40,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:16:40,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:16:40,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:40,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:16:40,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:16:40,680 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-14 15:16:40,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:16:40,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:16:40,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:16:40,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:16:40,863 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:16:40,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound20.c [2022-04-14 15:16:40,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ced2457d/22a900efe3cf4fa993b85b23f4ed8b50/FLAG547aa12ad [2022-04-14 15:16:41,214 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:16:41,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound20.c [2022-04-14 15:16:41,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ced2457d/22a900efe3cf4fa993b85b23f4ed8b50/FLAG547aa12ad [2022-04-14 15:16:41,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ced2457d/22a900efe3cf4fa993b85b23f4ed8b50 [2022-04-14 15:16:41,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:16:41,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:16:41,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:41,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:16:41,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:16:41,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f29d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41, skipping insertion in model container [2022-04-14 15:16:41,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:16:41,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:16:41,793 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_valuebound20.c[525,538] [2022-04-14 15:16:41,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:41,834 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:16:41,841 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_valuebound20.c[525,538] [2022-04-14 15:16:41,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:41,859 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:16:41,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41 WrapperNode [2022-04-14 15:16:41,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:41,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:16:41,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:16:41,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:16:41,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:16:41,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:16:41,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:16:41,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:16:41,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (1/1) ... [2022-04-14 15:16:41,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:41,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:41,916 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-14 15:16:41,935 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-14 15:16:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:16:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:16:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:16:41,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:16:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:16:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:16:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:16:41,993 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:16:41,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:16:42,154 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:16:42,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:16:42,158 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:16:42,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:42 BoogieIcfgContainer [2022-04-14 15:16:42,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:16:42,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:16:42,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:16:42,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:16:42,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:16:41" (1/3) ... [2022-04-14 15:16:42,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ead745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:42, skipping insertion in model container [2022-04-14 15:16:42,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:41" (2/3) ... [2022-04-14 15:16:42,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ead745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:42, skipping insertion in model container [2022-04-14 15:16:42,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:42" (3/3) ... [2022-04-14 15:16:42,165 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound20.c [2022-04-14 15:16:42,168 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:16:42,168 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:16:42,214 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:16:42,218 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 15:16:42,218 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:16:42,232 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-14 15:16:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:42,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:42,236 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:42,236 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-14 15:16:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:42,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934644587] [2022-04-14 15:16:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:42,417 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-14 15:16:42,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-14 15:16:42,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-14 15:16:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:42,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-14 15:16:42,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-14 15:16:42,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-14 15:16:42,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-14 15:16:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 15:16:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:42,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-14 15:16:42,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-14 15:16:42,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-14 15:16:42,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-14 15:16:42,449 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-14 15:16:42,450 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-14 15:16:42,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-14 15:16:42,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-14 15:16:42,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-14 15:16:42,450 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-14 15:16:42,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {41#true} is VALID [2022-04-14 15:16:42,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-14 15:16:42,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-14 15:16:42,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-14 15:16:42,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-14 15:16:42,452 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-14 15:16:42,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-14 15:16:42,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-14 15:16:42,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-14 15:16:42,454 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-14 15:16:42,454 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-14 15:16:42,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-14 15:16:42,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-14 15:16:42,455 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-14 15:16:42,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-14 15:16:42,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-14 15:16:42,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-14 15:16:42,456 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-14 15:16:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:42,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934644587] [2022-04-14 15:16:42,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934644587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:42,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:42,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:16:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762785835] [2022-04-14 15:16:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:42,464 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-14 15:16:42,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:42,468 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-14 15:16:42,497 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-14 15:16:42,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:16:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:16:42,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:16:42,517 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-14 15:16:44,652 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-14 15:16:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:44,903 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-14 15:16:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:16:44,903 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-14 15:16:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:44,904 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-14 15:16:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-14 15:16:44,913 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-14 15:16:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-14 15:16:44,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-14 15:16:45,096 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-14 15:16:45,102 INFO L225 Difference]: With dead ends: 69 [2022-04-14 15:16:45,103 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 15:16:45,104 INFO L912 BasicCegarLoop]: 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-14 15:16:45,107 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:45,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 15:16:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 15:16:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 15:16:45,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:45,131 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-14 15:16:45,131 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-14 15:16:45,132 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-14 15:16:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:45,136 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-14 15:16:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-14 15:16:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:45,138 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-14 15:16:45,138 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-14 15:16:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:45,142 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-14 15:16:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-14 15:16:45,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:45,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:45,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:45,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:45,144 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-14 15:16:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-14 15:16:45,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-14 15:16:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:45,148 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-14 15:16:45,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-14 15:16:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-14 15:16:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:16:45,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:45,150 INFO L499 BasicCegarLoop]: 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-14 15:16:45,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:16:45,150 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-14 15:16:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:45,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745836478] [2022-04-14 15:16:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:45,379 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-14 15:16:45,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-14 15:16:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:45,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-14 15:16:45,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-14 15:16:45,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-14 15:16:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 15:16:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:45,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-14 15:16:45,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-14 15:16:45,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-14 15:16:45,401 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-14 15:16:45,401 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-14 15:16:45,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-14 15:16:45,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-14 15:16:45,404 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-14 15:16:45,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {274#true} is VALID [2022-04-14 15:16:45,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-14 15:16:45,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-14 15:16:45,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-14 15:16:45,406 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-14 15:16:45,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-14 15:16:45,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-14 15:16:45,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-14 15:16:45,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-14 15:16:45,407 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-14 15:16:45,408 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-14 15:16:45,409 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-14 15:16:45,410 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-14 15:16:45,411 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-14 15:16:45,411 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-14 15:16:45,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:16:45,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:16:45,413 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-14 15:16:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:45,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745836478] [2022-04-14 15:16:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745836478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:45,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:45,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796285361] [2022-04-14 15:16:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:45,416 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-14 15:16:45,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:45,417 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-14 15:16:45,431 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-14 15:16:45,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:45,435 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-14 15:16:47,810 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-14 15:16:49,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:57,342 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-14 15:17:01,434 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-14 15:17:03,436 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-14 15:17:04,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:06,894 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-14 15:17:09,080 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-14 15:17:11,092 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-14 15:17:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,376 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-14 15:17:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:17:11,377 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-14 15:17:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:11,377 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-14 15:17:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-14 15:17:11,381 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-14 15:17:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-14 15:17:11,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-14 15:17:11,613 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-14 15:17:11,616 INFO L225 Difference]: With dead ends: 68 [2022-04-14 15:17:11,616 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 15:17:11,616 INFO L912 BasicCegarLoop]: 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-14 15:17:11,620 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 53 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:11,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 55 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 20.0s Time] [2022-04-14 15:17:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 15:17:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 15:17:11,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:11,635 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-14 15:17:11,637 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-14 15:17:11,639 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-14 15:17:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,651 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-14 15:17:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-14 15:17:11,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:11,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:11,656 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-14 15:17:11,657 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-14 15:17:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,660 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-14 15:17:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-14 15:17:11,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:11,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:11,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:11,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:11,661 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-14 15:17:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-14 15:17:11,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-14 15:17:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:11,664 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-14 15:17:11,664 INFO L479 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-14 15:17:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-14 15:17:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 15:17:11,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:11,668 INFO L499 BasicCegarLoop]: 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-14 15:17:11,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:17:11,669 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-14 15:17:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:11,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255005441] [2022-04-14 15:17:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,802 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-14 15:17:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-14 15:17:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-14 15:17:11,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-14 15:17:11,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 15:17:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-14 15:17:11,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-14 15:17:11,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-14 15:17:11,833 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-14 15:17:11,833 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-14 15:17:11,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-14 15:17:11,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-14 15:17:11,833 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-14 15:17:11,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {582#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-14 15:17:11,834 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-14 15:17:11,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-14 15:17:11,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-14 15:17:11,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-14 15:17:11,835 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-14 15:17:11,835 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-14 15:17:11,836 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-14 15:17:11,836 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-14 15:17:11,837 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-14 15:17:11,837 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-14 15:17:11,839 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-14 15:17:11,839 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-14 15:17:11,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {583#false} is VALID [2022-04-14 15:17:11,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-14 15:17:11,840 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-14 15:17:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255005441] [2022-04-14 15:17:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255005441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:17:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:17:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:17:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204977744] [2022-04-14 15:17:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:17:11,841 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-14 15:17:11,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:11,841 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-14 15:17:11,854 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-14 15:17:11,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:17:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:11,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:17:11,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:17:11,855 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-14 15:17:21,700 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-14 15:17:25,616 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-14 15:17:27,618 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-14 15:17:29,620 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-14 15:17:31,621 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-14 15:17:33,687 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-14 15:17:35,836 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-14 15:17:37,846 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-14 15:17:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:38,573 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-04-14 15:17:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:17:38,573 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-14 15:17:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:38,574 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-14 15:17:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-14 15:17:38,576 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-14 15:17:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-14 15:17:38,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-14 15:17:38,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:38,879 INFO L225 Difference]: With dead ends: 76 [2022-04-14 15:17:38,879 INFO L226 Difference]: Without dead ends: 72 [2022-04-14 15:17:38,880 INFO L912 BasicCegarLoop]: 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-14 15:17:38,880 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 70 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:38,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 54 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 222 Invalid, 8 Unknown, 0 Unchecked, 19.2s Time] [2022-04-14 15:17:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-14 15:17:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-14 15:17:38,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:38,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:38,903 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:38,903 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:38,908 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2022-04-14 15:17:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-04-14 15:17:38,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:38,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:38,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 72 states. [2022-04-14 15:17:38,910 INFO L87 Difference]: Start difference. First operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 72 states. [2022-04-14 15:17:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:38,913 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2022-04-14 15:17:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-04-14 15:17:38,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:38,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:38,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:38,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 32 states have call successors, (32), 6 states have call predecessors, (32), 5 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2022-04-14 15:17:38,917 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 26 [2022-04-14 15:17:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:38,917 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2022-04-14 15:17:38,918 INFO L479 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-14 15:17:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2022-04-14 15:17:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:17:38,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:38,918 INFO L499 BasicCegarLoop]: 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-14 15:17:38,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 15:17:38,918 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-14 15:17:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:38,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78538460] [2022-04-14 15:17:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:38,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:38,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886731889] [2022-04-14 15:17:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:38,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:38,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:38,933 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-14 15:17:38,934 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-14 15:17:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:38,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:17:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:39,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:39,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#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); {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-14 15:17:39,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #103#return; {986#true} is VALID [2022-04-14 15:17:39,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {986#true} is VALID [2022-04-14 15:17:39,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {986#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2022-04-14 15:17:39,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-14 15:17:39,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {986#true} {986#true} #81#return; {986#true} is VALID [2022-04-14 15:17:39,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {986#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {986#true} is VALID [2022-04-14 15:17:39,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2022-04-14 15:17:39,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2022-04-14 15:17:39,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-14 15:17:39,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {986#true} {986#true} #83#return; {986#true} is VALID [2022-04-14 15:17:39,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,205 INFO L272 TraceCheckUtils]: 20: Hoare triple {1039#(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)); {986#true} is VALID [2022-04-14 15:17:39,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2022-04-14 15:17:39,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2022-04-14 15:17:39,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-14 15:17:39,206 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {986#true} {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,206 INFO L272 TraceCheckUtils]: 25: Hoare triple {1039#(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)); {986#true} is VALID [2022-04-14 15:17:39,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2022-04-14 15:17:39,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2022-04-14 15:17:39,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-14 15:17:39,208 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {986#true} {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1039#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:17:39,209 INFO L272 TraceCheckUtils]: 30: Hoare triple {1039#(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)); {1082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:39,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {1082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:39,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {1086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {987#false} is VALID [2022-04-14 15:17:39,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-14 15:17:39,210 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-14 15:17:39,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:17:39,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:39,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78538460] [2022-04-14 15:17:39,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:39,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886731889] [2022-04-14 15:17:39,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886731889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:17:39,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:17:39,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:17:39,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505241786] [2022-04-14 15:17:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:17:39,211 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-14 15:17:39,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:39,211 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-14 15:17:39,239 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-14 15:17:39,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:17:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:17:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:17:39,240 INFO L87 Difference]: Start difference. First operand 69 states and 100 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-14 15:17:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:48,471 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2022-04-14 15:17:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:17:48,471 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-14 15:17:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:48,472 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-14 15:17:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:17:48,477 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-14 15:17:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:17:48,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:17:48,552 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-14 15:17:48,554 INFO L225 Difference]: With dead ends: 80 [2022-04-14 15:17:48,555 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 15:17:48,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:17:48,556 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:48,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 15:17:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 15:17:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-14 15:17:48,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:48,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:17:48,569 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:17:48,569 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:17:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:48,573 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-14 15:17:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-14 15:17:48,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:48,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:48,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-14 15:17:48,574 INFO L87 Difference]: Start difference. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-14 15:17:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:48,577 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-14 15:17:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-14 15:17:48,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:48,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:48,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:48,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 15:17:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2022-04-14 15:17:48,580 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 34 [2022-04-14 15:17:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:48,580 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-04-14 15:17:48,580 INFO L479 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-14 15:17:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-14 15:17:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 15:17:48,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:48,581 INFO L499 BasicCegarLoop]: 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-14 15:17:48,589 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-14 15:17:48,785 WARN L460 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-14 15:17:48,785 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-14 15:17:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:48,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311585480] [2022-04-14 15:17:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:48,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:48,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293460293] [2022-04-14 15:17:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:48,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:48,811 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-14 15:17:48,812 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-14 15:17:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:48,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:17:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:48,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:49,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2022-04-14 15:17:49,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#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); {1421#true} is VALID [2022-04-14 15:17:49,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-14 15:17:49,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #103#return; {1421#true} is VALID [2022-04-14 15:17:49,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret5 := main(); {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {1421#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 20 then 1 else 0)); {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1421#true} {1421#true} #81#return; {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {1421#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-14 15:17:49,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-14 15:17:49,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-14 15:17:49,007 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1421#true} {1421#true} #83#return; {1421#true} is VALID [2022-04-14 15:17:49,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1474#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {1474#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {1474#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {1474#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {1474#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {1474#(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)); {1421#true} is VALID [2022-04-14 15:17:49,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-14 15:17:49,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-14 15:17:49,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-14 15:17:49,011 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1421#true} {1474#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,011 INFO L272 TraceCheckUtils]: 27: Hoare triple {1474#(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)); {1421#true} is VALID [2022-04-14 15:17:49,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {1421#true} ~cond := #in~cond; {1421#true} is VALID [2022-04-14 15:17:49,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {1421#true} assume !(0 == ~cond); {1421#true} is VALID [2022-04-14 15:17:49,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-14 15:17:49,012 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1421#true} {1474#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1474#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:17:49,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {1474#(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)); {1523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:49,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {1523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:49,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {1527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1422#false} is VALID [2022-04-14 15:17:49,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-04-14 15:17:49,014 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-14 15:17:49,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:17:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:49,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311585480] [2022-04-14 15:17:49,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:49,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293460293] [2022-04-14 15:17:49,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293460293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:17:49,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:17:49,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:17:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404358388] [2022-04-14 15:17:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:17:49,016 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-14 15:17:49,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:49,016 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-14 15:17:49,038 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-14 15:17:49,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:17:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:49,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:17:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:17:49,039 INFO L87 Difference]: Start difference. First operand 57 states and 82 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-14 15:17:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:54,082 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2022-04-14 15:17:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:17:54,082 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-14 15:17:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:54,082 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-14 15:17:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:17:54,084 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-14 15:17:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:17:54,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 15:17:54,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:54,158 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:17:54,158 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 15:17:54,158 INFO L912 BasicCegarLoop]: 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-14 15:17:54,159 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:54,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-14 15:17:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 15:17:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-14 15:17:54,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:54,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:54,174 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:54,174 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:54,177 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2022-04-14 15:17:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-14 15:17:54,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:54,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:54,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 15:17:54,178 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 15:17:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:54,180 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2022-04-14 15:17:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-14 15:17:54,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:54,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:54,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:54,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 15:17:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2022-04-14 15:17:54,183 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 36 [2022-04-14 15:17:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:54,184 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2022-04-14 15:17:54,184 INFO L479 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-14 15:17:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-04-14 15:17:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 15:17:54,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:54,185 INFO L499 BasicCegarLoop]: 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-14 15:17:54,201 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-14 15:17:54,401 WARN L460 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-14 15:17:54,401 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-14 15:17:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:54,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084481887] [2022-04-14 15:17:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:54,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157758261] [2022-04-14 15:17:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:54,428 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-14 15:17:54,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process