/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:52:40,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:52:40,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:52:40,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:52:40,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:52:40,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:52:40,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:52:40,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:52:40,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:52:40,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:52:40,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:52:40,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:52:40,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:52:40,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:52:40,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:52:40,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:52:40,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:52:40,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:52:40,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:52:40,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:52:40,181 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:52:40,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:52:40,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:52:40,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:52:40,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:52:40,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:52:40,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:52:40,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:52:40,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:52:40,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:52:40,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:52:40,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:52:40,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:52:40,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:52:40,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:52:40,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:52:40,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:52:40,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:52:40,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:52:40,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:52:40,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:52:40,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:52:40,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:52:40,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:52:40,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:52:40,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:52:40,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:52:40,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:52:40,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:52:40,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:52:40,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:40,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:52:40,206 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:52:40,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:52:40,207 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:52:40,207 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 04:52:40,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:52:40,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:52:40,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:52:40,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:52:40,471 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:52:40,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-04-28 04:52:40,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fbdd46/c81a11a2120c43b4894e89fed61bb1e7/FLAGfc0038c53 [2022-04-28 04:52:40,938 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:52:40,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-04-28 04:52:40,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fbdd46/c81a11a2120c43b4894e89fed61bb1e7/FLAGfc0038c53 [2022-04-28 04:52:41,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26fbdd46/c81a11a2120c43b4894e89fed61bb1e7 [2022-04-28 04:52:41,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:52:41,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:52:41,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:41,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:52:41,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:52:41,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abb27cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41, skipping insertion in model container [2022-04-28 04:52:41,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:52:41,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:52:41,500 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_valuebound1.c[525,538] [2022-04-28 04:52:41,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:41,538 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:52:41,559 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_valuebound1.c[525,538] [2022-04-28 04:52:41,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:41,609 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:52:41,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41 WrapperNode [2022-04-28 04:52:41,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:41,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:52:41,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:52:41,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:52:41,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:52:41,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:52:41,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:52:41,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:52:41,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (1/1) ... [2022-04-28 04:52:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:41,667 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 04:52:41,669 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 04:52:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:52:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:52:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:52:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:52:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:52:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:52:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:52:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:52:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:52:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:52:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:52:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:52:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:52:41,761 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:52:41,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:52:42,044 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:52:42,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:52:42,051 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:52:42,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:42 BoogieIcfgContainer [2022-04-28 04:52:42,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:52:42,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:52:42,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:52:42,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:52:42,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:52:41" (1/3) ... [2022-04-28 04:52:42,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154947b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:42, skipping insertion in model container [2022-04-28 04:52:42,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:41" (2/3) ... [2022-04-28 04:52:42,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154947b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:42, skipping insertion in model container [2022-04-28 04:52:42,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:42" (3/3) ... [2022-04-28 04:52:42,060 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2022-04-28 04:52:42,072 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:52:42,073 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:52:42,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:52:42,139 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@19dff2e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3522faf1 [2022-04-28 04:52:42,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:52:42,158 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-28 04:52:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:52:42,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:42,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:52:42,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-28 04:52:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:42,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608554244] [2022-04-28 04:52:42,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:42,194 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-28 04:52:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:42,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507159424] [2022-04-28 04:52:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:52:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:42,413 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-28 04:52:42,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:52:42,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:52:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:52:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:42,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:42,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:42,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:42,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:52:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:52:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:42,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:42,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:42,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:42,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:52:42,456 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-28 04:52:42,456 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-28 04:52:42,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:52:42,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:52:42,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-28 04:52:42,458 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-28 04:52:42,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 04:52:42,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:42,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:42,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:42,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:52:42,460 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-28 04:52:42,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:42,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:42,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:42,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:52:42,465 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-28 04:52:42,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:52:42,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:52:42,466 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-28 04:52:42,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 04:52:42,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 04:52:42,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 04:52:42,467 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-28 04:52:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507159424] [2022-04-28 04:52:42,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507159424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:42,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:42,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:42,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:42,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608554244] [2022-04-28 04:52:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608554244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:42,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294872389] [2022-04-28 04:52:42,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:42,476 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-28 04:52:42,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:42,482 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-28 04:52:42,519 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-28 04:52:42,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:52:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:42,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:52:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:52:42,546 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-28 04:52:49,629 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-28 04:52:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:49,953 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-28 04:52:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:52:49,953 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-28 04:52:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:52:49,954 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-28 04:52:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:52:49,964 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-28 04:52:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:52:49,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-28 04:52:50,114 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-28 04:52:50,127 INFO L225 Difference]: With dead ends: 69 [2022-04-28 04:52:50,127 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:52:50,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:52:50,134 INFO L413 NwaCegarLoop]: 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-28 04:52:50,135 INFO L414 NwaCegarLoop]: 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-28 04:52:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:52:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 04:52:50,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:52:50,175 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-28 04:52:50,176 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-28 04:52:50,176 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-28 04:52:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:50,181 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:52:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:52:50,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:50,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:50,182 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-28 04:52:50,183 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-28 04:52:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:50,187 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:52:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:52:50,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:50,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:50,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:52:50,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:52:50,188 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-28 04:52:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-28 04:52:50,192 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-28 04:52:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:52:50,193 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-28 04:52:50,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:52:50,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-28 04:52:50,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:52:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:52:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:52:50,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:50,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:52:50,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:52:50,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-28 04:52:50,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:50,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818781329] [2022-04-28 04:52:50,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-28 04:52:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:50,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687008469] [2022-04-28 04:52:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:52:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:50,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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); {327#true} is VALID [2022-04-28 04:52:50,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:52:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:52:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:50,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:52:50,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:52:50,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:52:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:52:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:50,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:52:50,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:52:50,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:52:50,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:52:50,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(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); {327#true} is VALID [2022-04-28 04:52:50,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:52:50,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-28 04:52:50,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-28 04:52:50,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {327#true} is VALID [2022-04-28 04:52:50,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:52:50,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:52:50,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:52:50,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {327#true} is VALID [2022-04-28 04:52:50,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:52:50,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:52:50,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:52:50,529 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:52:50,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:52:50,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:52:50,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {341#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 04:52:50,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} assume !false; {341#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 04:52:50,535 INFO L272 TraceCheckUtils]: 20: Hoare triple {341#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:52:50,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:52:50,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-28 04:52:50,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-28 04:52:50,537 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-28 04:52:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687008469] [2022-04-28 04:52:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687008469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:52:50,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:50,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1818781329] [2022-04-28 04:52:50,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1818781329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:50,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:50,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:52:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121659864] [2022-04-28 04:52:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:50,540 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-28 04:52:50,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:50,541 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-28 04:52:50,560 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-28 04:52:50,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:52:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:50,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:52:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:52:50,561 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-28 04:52:53,031 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-28 04:52:57,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:53:06,283 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-28 04:53:08,362 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-28 04:53:10,366 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-28 04:53:13,252 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-28 04:53:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:14,816 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-28 04:53:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:53:14,817 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-28 04:53:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:14,817 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-28 04:53:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-28 04:53:14,822 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-28 04:53:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-04-28 04:53:14,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 97 transitions. [2022-04-28 04:53:15,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:15,039 INFO L225 Difference]: With dead ends: 67 [2022-04-28 04:53:15,040 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 04:53:15,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:53:15,047 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 41 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:15,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 17.9s Time] [2022-04-28 04:53:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 04:53:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-28 04:53:15,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:15,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:15,074 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:15,074 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:15,078 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 04:53:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 04:53:15,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:15,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:15,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-28 04:53:15,080 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 49 states. [2022-04-28 04:53:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:15,084 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 04:53:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 04:53:15,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:15,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:15,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:15,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 04:53:15,089 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 24 [2022-04-28 04:53:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:15,090 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 04:53:15,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:15,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 04:53:15,321 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 04:53:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 04:53:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:53:15,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:15,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:15,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:53:15,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-28 04:53:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452743562] [2022-04-28 04:53:15,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-28 04:53:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:15,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985767329] [2022-04-28 04:53:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:15,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(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); {683#true} is VALID [2022-04-28 04:53:15,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-28 04:53:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:15,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:15,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:15,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-28 04:53:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:15,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:15,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:15,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-28 04:53:15,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:15,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#(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); {683#true} is VALID [2022-04-28 04:53:15,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-28 04:53:15,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret5 := main(); {683#true} is VALID [2022-04-28 04:53:15,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {683#true} is VALID [2022-04-28 04:53:15,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {683#true} is VALID [2022-04-28 04:53:15,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:15,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:15,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-28 04:53:15,565 INFO L272 TraceCheckUtils]: 11: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {683#true} is VALID [2022-04-28 04:53:15,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:15,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:15,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:15,566 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-28 04:53:15,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {683#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {696#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:15,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {696#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:15,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {696#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {697#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:15,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {697#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:15,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {697#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {698#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-28 04:53:15,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} assume !false; {698#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-28 04:53:15,574 INFO L272 TraceCheckUtils]: 22: Hoare triple {698#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {699#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:53:15,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {699#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {700#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:53:15,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {700#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {684#false} is VALID [2022-04-28 04:53:15,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-28 04:53:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:53:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985767329] [2022-04-28 04:53:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985767329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:53:15,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360041423] [2022-04-28 04:53:15,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:15,583 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 04:53:15,596 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 04:53:15,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:53:15,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:15,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:53:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:15,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:16,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2022-04-28 04:53:16,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#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); {683#true} is VALID [2022-04-28 04:53:16,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:16,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #103#return; {683#true} is VALID [2022-04-28 04:53:16,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret5 := main(); {683#true} is VALID [2022-04-28 04:53:16,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {683#true} is VALID [2022-04-28 04:53:16,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {683#true} is VALID [2022-04-28 04:53:16,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:16,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:16,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:16,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #81#return; {683#true} is VALID [2022-04-28 04:53:16,078 INFO L272 TraceCheckUtils]: 11: Hoare triple {683#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {683#true} is VALID [2022-04-28 04:53:16,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2022-04-28 04:53:16,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2022-04-28 04:53:16,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-28 04:53:16,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {683#true} {683#true} #83#return; {683#true} is VALID [2022-04-28 04:53:16,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {683#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:16,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:16,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:16,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:16,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {766#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 04:53:16,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {766#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} assume !false; {766#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 04:53:16,083 INFO L272 TraceCheckUtils]: 22: Hoare triple {766#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:16,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:16,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {684#false} is VALID [2022-04-28 04:53:16,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-28 04:53:16,085 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-28 04:53:16,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360041423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:16,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:53:16,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-28 04:53:16,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:16,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452743562] [2022-04-28 04:53:16,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452743562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:16,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:16,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:53:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407045898] [2022-04-28 04:53:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:16,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:16,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:16,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:16,107 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-28 04:53:16,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:53:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:16,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:53:16,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:53:16,109 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:23,362 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-28 04:53:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,591 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-04-28 04:53:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:53:35,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 04:53:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 04:53:35,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-28 04:53:35,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:35,899 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:53:35,899 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 04:53:35,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:53:35,900 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:35,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 04:53:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 04:53:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-28 04:53:35,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:35,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:35,975 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:35,976 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,982 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-28 04:53:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-28 04:53:35,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:35,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:35,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-28 04:53:35,984 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 70 states. [2022-04-28 04:53:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,988 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-04-28 04:53:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-28 04:53:35,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:35,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:35,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:35,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-28 04:53:35,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-28 04:53:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-28 04:53:35,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 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-28 04:53:35,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-28 04:53:36,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-28 04:53:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:53:36,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:36,391 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:36,417 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-28 04:53:36,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:36,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-28 04:53:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:36,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130434616] [2022-04-28 04:53:36,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-28 04:53:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:36,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739698821] [2022-04-28 04:53:36,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:36,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:36,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461685119] [2022-04-28 04:53:36,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:36,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:36,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:36,613 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 04:53:36,615 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-28 04:53:36,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:53:36,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:36,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:53:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:36,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {1205#true} call ULTIMATE.init(); {1205#true} is VALID [2022-04-28 04:53:36,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1205#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); {1205#true} is VALID [2022-04-28 04:53:36,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1205#true} assume true; {1205#true} is VALID [2022-04-28 04:53:36,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1205#true} {1205#true} #103#return; {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {1205#true} call #t~ret5 := main(); {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1205#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L272 TraceCheckUtils]: 6: Hoare triple {1205#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {1205#true} ~cond := #in~cond; {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1205#true} assume !(0 == ~cond); {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {1205#true} assume true; {1205#true} is VALID [2022-04-28 04:53:36,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1205#true} {1205#true} #81#return; {1205#true} is VALID [2022-04-28 04:53:36,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {1205#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1205#true} is VALID [2022-04-28 04:53:36,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {1205#true} ~cond := #in~cond; {1205#true} is VALID [2022-04-28 04:53:36,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1205#true} assume !(0 == ~cond); {1205#true} is VALID [2022-04-28 04:53:36,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1205#true} assume true; {1205#true} is VALID [2022-04-28 04:53:36,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1205#true} {1205#true} #83#return; {1205#true} is VALID [2022-04-28 04:53:36,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {1205#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,924 INFO L272 TraceCheckUtils]: 20: Hoare triple {1258#(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)); {1205#true} is VALID [2022-04-28 04:53:36,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {1205#true} ~cond := #in~cond; {1205#true} is VALID [2022-04-28 04:53:36,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {1205#true} assume !(0 == ~cond); {1205#true} is VALID [2022-04-28 04:53:36,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {1205#true} assume true; {1205#true} is VALID [2022-04-28 04:53:36,925 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1205#true} {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,925 INFO L272 TraceCheckUtils]: 25: Hoare triple {1258#(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)); {1205#true} is VALID [2022-04-28 04:53:36,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {1205#true} ~cond := #in~cond; {1205#true} is VALID [2022-04-28 04:53:36,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {1205#true} assume !(0 == ~cond); {1205#true} is VALID [2022-04-28 04:53:36,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {1205#true} assume true; {1205#true} is VALID [2022-04-28 04:53:36,926 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1205#true} {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1258#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:36,928 INFO L272 TraceCheckUtils]: 30: Hoare triple {1258#(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)); {1301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:36,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {1301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:36,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {1305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1206#false} is VALID [2022-04-28 04:53:36,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {1206#false} assume !false; {1206#false} is VALID [2022-04-28 04:53:36,929 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-28 04:53:36,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739698821] [2022-04-28 04:53:36,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461685119] [2022-04-28 04:53:36,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461685119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:36,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:36,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:36,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:36,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130434616] [2022-04-28 04:53:36,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130434616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:36,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:36,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786671537] [2022-04-28 04:53:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:36,931 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-28 04:53:36,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:36,932 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-28 04:53:36,956 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-28 04:53:36,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:53:36,957 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:40,326 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 04:53:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:53:40,326 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-28 04:53:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:40,327 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-28 04:53:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:53:40,329 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-28 04:53:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:53:40,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 04:53:40,404 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-28 04:53:40,406 INFO L225 Difference]: With dead ends: 74 [2022-04-28 04:53:40,406 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:53:40,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:53:40,407 INFO L413 NwaCegarLoop]: 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-28 04:53:40,408 INFO L414 NwaCegarLoop]: 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-28 04:53:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:53:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 04:53:40,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:40,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:53:40,426 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:53:40,427 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:53:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:40,429 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:53:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:40,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:40,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:40,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 04:53:40,431 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 04:53:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:40,433 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:53:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:40,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:40,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:40,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:40,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:53:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-28 04:53:40,437 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-28 04:53:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:40,437 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-28 04:53:40,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:40,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-28 04:53:40,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:53:40,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:40,605 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:40,615 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-28 04:53:40,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:53:40,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-28 04:53:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900501308] [2022-04-28 04:53:40,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-28 04:53:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:40,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649471259] [2022-04-28 04:53:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:40,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:40,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935378649] [2022-04-28 04:53:40,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:40,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:40,856 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-28 04:53:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:53:40,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:53:40,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:40,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:53:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:40,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:41,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2022-04-28 04:53:41,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#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); {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} #103#return; {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {1665#true} call #t~ret5 := main(); {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {1665#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-04-28 04:53:41,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-04-28 04:53:41,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-04-28 04:53:41,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1665#true} {1665#true} #81#return; {1665#true} is VALID [2022-04-28 04:53:41,137 INFO L272 TraceCheckUtils]: 11: Hoare triple {1665#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1665#true} is VALID [2022-04-28 04:53:41,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-04-28 04:53:41,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-04-28 04:53:41,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-04-28 04:53:41,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1665#true} {1665#true} #83#return; {1665#true} is VALID [2022-04-28 04:53:41,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {1665#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {1718#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {1718#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1718#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {1718#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {1718#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,145 INFO L272 TraceCheckUtils]: 22: Hoare triple {1718#(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)); {1665#true} is VALID [2022-04-28 04:53:41,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-04-28 04:53:41,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-04-28 04:53:41,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-04-28 04:53:41,146 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1665#true} {1718#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,146 INFO L272 TraceCheckUtils]: 27: Hoare triple {1718#(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)); {1665#true} is VALID [2022-04-28 04:53:41,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2022-04-28 04:53:41,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2022-04-28 04:53:41,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {1665#true} assume true; {1665#true} is VALID [2022-04-28 04:53:41,151 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1665#true} {1718#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1718#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:41,152 INFO L272 TraceCheckUtils]: 32: Hoare triple {1718#(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)); {1767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:41,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:41,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {1771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1666#false} is VALID [2022-04-28 04:53:41,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2022-04-28 04:53:41,153 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-28 04:53:41,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649471259] [2022-04-28 04:53:41,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935378649] [2022-04-28 04:53:41,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935378649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:41,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:41,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:41,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900501308] [2022-04-28 04:53:41,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900501308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:41,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:41,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011960733] [2022-04-28 04:53:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:41,155 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-28 04:53:41,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:41,156 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-28 04:53:41,178 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-28 04:53:41,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:53:41,179 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:47,648 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-28 04:53:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:53:47,648 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-28 04:53:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:47,649 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-28 04:53:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:53:47,650 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-28 04:53:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:53:47,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 04:53:47,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:47,728 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:53:47,729 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:53:47,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:53:47,730 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:47,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:53:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:53:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 04:53:47,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:47,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:47,758 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:47,758 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:47,761 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:53:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:53:47,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:47,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:47,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 04:53:47,763 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 04:53:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:47,766 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:53:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:53:47,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:47,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:47,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:47,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-28 04:53:47,773 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-28 04:53:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:47,773 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-28 04:53:47,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:47,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-28 04:53:48,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:53:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:53:48,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:48,267 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:48,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:53:48,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:48,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-28 04:53:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882685553] [2022-04-28 04:53:48,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-28 04:53:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739039979] [2022-04-28 04:53:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:48,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:48,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153220837] [2022-04-28 04:53:48,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:48,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:53:48,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process