/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/lcm1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:49:29,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:49:29,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:49:29,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:49:29,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:49:29,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:49:29,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:49:29,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:49:29,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:49:29,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:49:29,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:49:29,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:49:29,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:49:29,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:49:29,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:49:29,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:49:29,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:49:29,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:49:29,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:49:29,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:49:29,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:49:29,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:49:29,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:49:29,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:49:29,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:49:29,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:49:29,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:49:29,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:49:29,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:49:29,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:49:29,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:49:29,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:49:29,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:49:29,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:49:29,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:49:29,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:49:29,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:49:29,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:49:29,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:49:29,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:49:29,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:49:29,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:49:29,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:49:29,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:49:29,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:49:29,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:49:29,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:49:29,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:49:29,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:49:29,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:49:29,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:49:29,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:49:29,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:49:29,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:49:29,903 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 10:49:30,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:49:30,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:49:30,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:49:30,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:49:30,113 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:49:30,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm1.c [2022-04-28 10:49:30,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfc98419/bc3a52ec4ef842bd9fc10000ad1a11ed/FLAG3706ecc29 [2022-04-28 10:49:30,479 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:49:30,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm1.c [2022-04-28 10:49:30,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfc98419/bc3a52ec4ef842bd9fc10000ad1a11ed/FLAG3706ecc29 [2022-04-28 10:49:30,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfc98419/bc3a52ec4ef842bd9fc10000ad1a11ed [2022-04-28 10:49:30,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:49:30,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:49:30,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:49:30,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:49:30,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:49:30,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:49:30" (1/1) ... [2022-04-28 10:49:30,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ed341c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:30, skipping insertion in model container [2022-04-28 10:49:30,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:49:30" (1/1) ... [2022-04-28 10:49:30,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:49:30,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:49:31,055 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/lcm1.c[552,565] [2022-04-28 10:49:31,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:49:31,071 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:49:31,079 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/lcm1.c[552,565] [2022-04-28 10:49:31,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:49:31,092 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:49:31,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31 WrapperNode [2022-04-28 10:49:31,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:49:31,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:49:31,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:49:31,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:49:31,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:49:31,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:49:31,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:49:31,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:49:31,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (1/1) ... [2022-04-28 10:49:31,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:49:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:49:31,135 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-28 10:49:31,153 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-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:49:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:49:31,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:49:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:49:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:49:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:49:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:49:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:49:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:49:31,204 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:49:31,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:49:31,307 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:49:31,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:49:31,311 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:49:31,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:49:31 BoogieIcfgContainer [2022-04-28 10:49:31,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:49:31,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:49:31,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:49:31,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:49:31,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:49:30" (1/3) ... [2022-04-28 10:49:31,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a087c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:49:31, skipping insertion in model container [2022-04-28 10:49:31,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:49:31" (2/3) ... [2022-04-28 10:49:31,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a087c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:49:31, skipping insertion in model container [2022-04-28 10:49:31,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:49:31" (3/3) ... [2022-04-28 10:49:31,323 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1.c [2022-04-28 10:49:31,331 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:49:31,331 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:49:31,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:49:31,378 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40dceb1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cff9014 [2022-04-28 10:49:31,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:49:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:49:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:49:31,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:49:31,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:49:31,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:49:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:49:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1751682979, now seen corresponding path program 1 times [2022-04-28 10:49:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:31,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691783341] [2022-04-28 10:49:31,411 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:49:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1751682979, now seen corresponding path program 2 times [2022-04-28 10:49:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:49:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395054597] [2022-04-28 10:49:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:49:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:49:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:49:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 10:49:31,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 10:49:31,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #108#return; {40#true} is VALID [2022-04-28 10:49:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:49:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-28 10:49:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:49:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-28 10:49:31,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 10:49:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-28 10:49:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 10:49:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:31,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-28 10:49:31,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:49:31,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 10:49:31,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 10:49:31,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #108#return; {40#true} is VALID [2022-04-28 10:49:31,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-28 10:49:31,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-28 10:49:31,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 10:49:31,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-28 10:49:31,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 10:49:31,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,672 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-28 10:49:31,673 INFO L272 TraceCheckUtils]: 16: Hoare triple {41#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {40#true} is VALID [2022-04-28 10:49:31,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,674 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-28 10:49:31,674 INFO L272 TraceCheckUtils]: 21: Hoare triple {41#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {40#true} is VALID [2022-04-28 10:49:31,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 10:49:31,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 10:49:31,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 10:49:31,676 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-28 10:49:31,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {41#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {41#false} is VALID [2022-04-28 10:49:31,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 10:49:31,678 INFO L272 TraceCheckUtils]: 28: Hoare triple {41#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-28 10:49:31,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 10:49:31,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 10:49:31,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 10:49:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:49:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:49:31,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395054597] [2022-04-28 10:49:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395054597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:31,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:31,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:49:31,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:49:31,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691783341] [2022-04-28 10:49:31,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691783341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:31,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:31,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:49:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014465251] [2022-04-28 10:49:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:49:31,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 10:49:31,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:49:31,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:49:31,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:49:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:49:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:49:31,750 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:49:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:31,940 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2022-04-28 10:49:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:49:31,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 10:49:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:49:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:49:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-04-28 10:49:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:49:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-04-28 10:49:31,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-04-28 10:49:32,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:32,078 INFO L225 Difference]: With dead ends: 67 [2022-04-28 10:49:32,079 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:49:32,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-28 10:49:32,083 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:49:32,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:49:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:49:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:49:32,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:49:32,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:49:32,103 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:49:32,103 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:49:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:32,107 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 10:49:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 10:49:32,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:32,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:32,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-28 10:49:32,108 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-28 10:49:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:32,111 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 10:49:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 10:49:32,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:32,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:32,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:49:32,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:49:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:49:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 10:49:32,114 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 32 [2022-04-28 10:49:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:49:32,114 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 10:49:32,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:49:32,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 10:49:32,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 10:49:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:49:32,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:49:32,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:49:32,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:49:32,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:49:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:49:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -442223298, now seen corresponding path program 1 times [2022-04-28 10:49:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:32,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178678998] [2022-04-28 10:49:32,158 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:49:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -442223298, now seen corresponding path program 2 times [2022-04-28 10:49:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:49:32,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010849888] [2022-04-28 10:49:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:49:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:49:32,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:49:32,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511657975] [2022-04-28 10:49:32,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:49:32,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:49:32,195 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-28 10:49:32,196 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-28 10:49:32,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:49:32,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:49:32,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:49:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:32,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:49:32,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-28 10:49:32,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-28 10:49:32,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 10:49:32,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #108#return; {326#true} is VALID [2022-04-28 10:49:32,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-28 10:49:32,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {326#true} is VALID [2022-04-28 10:49:32,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-28 10:49:32,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 10:49:32,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 10:49:32,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 10:49:32,429 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #90#return; {326#true} is VALID [2022-04-28 10:49:32,429 INFO L272 TraceCheckUtils]: 11: Hoare triple {326#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-28 10:49:32,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 10:49:32,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 10:49:32,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 10:49:32,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {326#true} {326#true} #92#return; {326#true} is VALID [2022-04-28 10:49:32,430 INFO L272 TraceCheckUtils]: 16: Hoare triple {326#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {326#true} is VALID [2022-04-28 10:49:32,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 10:49:32,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 10:49:32,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 10:49:32,431 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {326#true} {326#true} #94#return; {326#true} is VALID [2022-04-28 10:49:32,431 INFO L272 TraceCheckUtils]: 21: Hoare triple {326#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {326#true} is VALID [2022-04-28 10:49:32,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 10:49:32,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 10:49:32,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 10:49:32,431 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {326#true} {326#true} #96#return; {326#true} is VALID [2022-04-28 10:49:32,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {326#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:49:32,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !false; {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:49:32,433 INFO L272 TraceCheckUtils]: 28: Hoare triple {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:49:32,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:32,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-28 10:49:32,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-28 10:49:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:49:32,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:49:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:49:32,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010849888] [2022-04-28 10:49:32,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:49:32,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511657975] [2022-04-28 10:49:32,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511657975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:32,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:32,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:49:32,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:49:32,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178678998] [2022-04-28 10:49:32,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178678998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:32,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:32,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:49:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146059289] [2022-04-28 10:49:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:49:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-28 10:49:32,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:49:32,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 10:49:32,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:32,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:49:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:49:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:49:32,456 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 10:49:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:32,671 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-28 10:49:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:49:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-28 10:49:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:49:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 10:49:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:49:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 10:49:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 10:49:32,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 10:49:32,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:32,739 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:49:32,739 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:49:32,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-28 10:49:32,741 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:49:32,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:49:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:49:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-28 10:49:32,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:49:32,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:49:32,752 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:49:32,752 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:49:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:32,755 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 10:49:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-28 10:49:32,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:32,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:32,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-28 10:49:32,757 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-28 10:49:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:32,759 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 10:49:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-28 10:49:32,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:32,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:32,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:49:32,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:49:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:49:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 10:49:32,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2022-04-28 10:49:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:49:32,763 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-04-28 10:49:32,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 10:49:32,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 10:49:32,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:49:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-04-28 10:49:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:49:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:49:32,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:49:32,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:49:33,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:33,039 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:49:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:49:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1300584321, now seen corresponding path program 1 times [2022-04-28 10:49:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25158741] [2022-04-28 10:49:33,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:49:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1300584321, now seen corresponding path program 2 times [2022-04-28 10:49:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:49:33,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426131970] [2022-04-28 10:49:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:49:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:49:33,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:49:33,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899930997] [2022-04-28 10:49:33,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:49:33,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:49:33,076 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-28 10:49:33,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process