/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:53:19,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:53:19,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:53:19,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:53:19,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:53:19,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:53:19,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:53:19,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:53:19,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:53:19,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:53:19,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:53:19,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:53:19,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:53:19,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:53:19,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:53:19,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:53:19,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:53:19,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:53:19,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:53:19,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:53:19,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:53:19,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:53:19,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:53:19,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:53:19,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:53:19,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:53:19,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:53:19,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:53:19,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:53:19,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:53:19,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:53:19,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:53:19,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:53:19,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:53:19,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:53:19,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:53:19,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:53:19,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:53:19,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:53:19,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:53:19,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:53:19,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:53:19,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:53:19,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:53:19,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:53:19,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:53:19,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:53:19,989 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:53:19,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:53:19,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:53:19,990 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:53:19,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:53:19,991 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:53:19,991 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-15 07:53:20,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:53:20,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:53:20,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:53:20,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:53:20,170 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:53:20,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-15 07:53:20,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f516a5b6/2e6a3fbd43bb46fdacb7e10c2213a3d5/FLAG70ef93a19 [2022-04-15 07:53:20,561 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:53:20,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-15 07:53:20,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f516a5b6/2e6a3fbd43bb46fdacb7e10c2213a3d5/FLAG70ef93a19 [2022-04-15 07:53:20,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f516a5b6/2e6a3fbd43bb46fdacb7e10c2213a3d5 [2022-04-15 07:53:20,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:53:20,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:53:20,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:53:20,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:53:20,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:53:20,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c024c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20, skipping insertion in model container [2022-04-15 07:53:20,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:53:20,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:53:20,716 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_unwindbound2.c[525,538] [2022-04-15 07:53:20,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:53:20,749 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:53:20,756 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_unwindbound2.c[525,538] [2022-04-15 07:53:20,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:53:20,779 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:53:20,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20 WrapperNode [2022-04-15 07:53:20,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:53:20,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:53:20,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:53:20,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:53:20,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:53:20,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:53:20,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:53:20,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:53:20,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (1/1) ... [2022-04-15 07:53:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:53:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:53:20,836 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-15 07:53:20,849 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-15 07:53:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:53:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:53:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:53:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:53:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:53:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:53:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:53:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:53:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:53:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:53:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 07:53:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:53:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:53:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:53:20,915 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:53:20,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:53:21,078 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:53:21,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:53:21,083 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:53:21,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:53:21 BoogieIcfgContainer [2022-04-15 07:53:21,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:53:21,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:53:21,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:53:21,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:53:21,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:53:20" (1/3) ... [2022-04-15 07:53:21,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66107f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:53:21, skipping insertion in model container [2022-04-15 07:53:21,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:53:20" (2/3) ... [2022-04-15 07:53:21,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66107f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:53:21, skipping insertion in model container [2022-04-15 07:53:21,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:53:21" (3/3) ... [2022-04-15 07:53:21,098 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2022-04-15 07:53:21,101 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:53:21,101 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:53:21,126 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:53:21,130 INFO L340 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 [2022-04-15 07:53:21,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:53:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:53:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:53:21,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:21,147 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:21,148 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-15 07:53:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:21,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030804850] [2022-04-15 07:53:21,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-15 07:53:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448938884] [2022-04-15 07:53:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:53:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:21,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 07:53:21,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 07:53:21,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-15 07:53:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:53:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:21,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 07:53:21,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 07:53:21,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 07:53:21,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-15 07:53:21,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:53:21,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 07:53:21,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 07:53:21,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-15 07:53:21,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-15 07:53:21,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-15 07:53:21,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-15 07:53:21,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 07:53:21,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 07:53:21,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 07:53:21,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-15 07:53:21,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-15 07:53:21,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 07:53:21,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 07:53:21,354 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-15 07:53:21,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 07:53:21,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 07:53:21,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 07:53:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448938884] [2022-04-15 07:53:21,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448938884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:21,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:53:21,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:21,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030804850] [2022-04-15 07:53:21,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030804850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:21,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:21,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:53:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258170648] [2022-04-15 07:53:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:21,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:53:21,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:21,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:21,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:21,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:53:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:53:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:53:21,417 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:23,523 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-15 07:53:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:26,576 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-15 07:53:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:53:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:53:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 07:53:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 07:53:26,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-15 07:53:26,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:26,696 INFO L225 Difference]: With dead ends: 70 [2022-04-15 07:53:26,696 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:53:26,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:53:26,700 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:26,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 07:53:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:53:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 07:53:26,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:26,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:26,722 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:26,723 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:26,726 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:53:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:53:26,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:26,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:26,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 07:53:26,728 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 07:53:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:26,730 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:53:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:53:26,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:26,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:26,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:26,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 07:53:26,735 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-15 07:53:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:26,735 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-15 07:53:26,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:26,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-15 07:53:26,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 07:53:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:53:26,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:26,783 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:26,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:53:26,783 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-15 07:53:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1462286648] [2022-04-15 07:53:26,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-15 07:53:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:26,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619129371] [2022-04-15 07:53:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:26,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:53:26,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259759575] [2022-04-15 07:53:26,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:53:26,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:26,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:53:26,823 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-15 07:53:26,832 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-15 07:53:26,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:53:26,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:53:26,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:53:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:26,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:53:27,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-15 07:53:27,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:27,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {374#(<= |main_#t~post5| 0)} is VALID [2022-04-15 07:53:27,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {333#false} is VALID [2022-04-15 07:53:27,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-15 07:53:27,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 2);havoc #t~post6; {333#false} is VALID [2022-04-15 07:53:27,030 INFO L272 TraceCheckUtils]: 16: Hoare triple {333#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)); {333#false} is VALID [2022-04-15 07:53:27,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-15 07:53:27,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-15 07:53:27,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-15 07:53:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:27,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:53:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619129371] [2022-04-15 07:53:27,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:53:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259759575] [2022-04-15 07:53:27,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259759575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:27,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:27,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:53:27,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1462286648] [2022-04-15 07:53:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1462286648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:27,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:27,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:53:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850557607] [2022-04-15 07:53:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:53:27,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:27,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:27,047 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-15 07:53:27,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:53:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:53:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:53:27,048 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:31,557 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 07:53:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:53:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:53:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 07:53:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 07:53:31,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-15 07:53:31,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:31,628 INFO L225 Difference]: With dead ends: 55 [2022-04-15 07:53:31,628 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 07:53:31,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:53:31,629 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:31,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:53:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 07:53:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 07:53:31,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:31,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:31,652 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:31,652 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:31,654 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 07:53:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:31,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:31,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:31,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 07:53:31,656 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 07:53:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:31,657 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 07:53:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:31,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:31,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:31,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:31,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 07:53:31,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-15 07:53:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:31,660 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-15 07:53:31,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:31,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-15 07:53:31,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:53:31,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:31,700 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:31,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 07:53:31,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:31,916 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-15 07:53:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143233165] [2022-04-15 07:53:31,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-15 07:53:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:31,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121511652] [2022-04-15 07:53:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:31,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:53:31,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228419585] [2022-04-15 07:53:31,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:53:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:53:31,942 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-15 07:53:31,943 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-15 07:53:31,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:53:31,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:53:31,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:53:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:31,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:53:32,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-15 07:53:32,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#(<= ~counter~0 0)} {649#true} #102#return; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#(<= ~counter~0 0)} call #t~ret7 := main(); {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= ~counter~0 0)} ~cond := #in~cond; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= ~counter~0 0)} assume !(0 == ~cond); {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#(<= ~counter~0 0)} {657#(<= ~counter~0 0)} #82#return; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {657#(<= ~counter~0 0)} is VALID [2022-04-15 07:53:32,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-15 07:53:32,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-15 07:53:32,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {691#(<= ~counter~0 1)} is VALID [2022-04-15 07:53:32,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {701#(<= |main_#t~post6| 1)} is VALID [2022-04-15 07:53:32,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {650#false} is VALID [2022-04-15 07:53:32,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#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)); {650#false} is VALID [2022-04-15 07:53:32,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-15 07:53:32,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-15 07:53:32,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-15 07:53:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:32,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:53:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:32,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121511652] [2022-04-15 07:53:32,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:53:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228419585] [2022-04-15 07:53:32,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228419585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:32,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:32,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:32,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143233165] [2022-04-15 07:53:32,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143233165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:32,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:32,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176008075] [2022-04-15 07:53:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 07:53:32,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:32,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:32,122 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-15 07:53:32,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:53:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:53:32,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:53:32,123 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:40,685 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-15 07:53:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:53:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 07:53:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:53:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 07:53:40,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 07:53:40,737 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-15 07:53:40,738 INFO L225 Difference]: With dead ends: 49 [2022-04-15 07:53:40,738 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 07:53:40,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:53:40,739 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:40,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:53:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 07:53:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 07:53:40,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:40,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:40,753 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:40,753 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:40,755 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 07:53:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 07:53:40,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:40,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:40,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-15 07:53:40,756 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-15 07:53:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:40,758 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 07:53:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-15 07:53:40,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:40,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:40,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:40,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-15 07:53:40,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-15 07:53:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:40,761 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-15 07:53:40,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:40,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 52 transitions. [2022-04-15 07:53:40,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-15 07:53:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:53:40,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:40,807 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:40,836 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-15 07:53:41,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 07:53:41,023 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-15 07:53:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374170723] [2022-04-15 07:53:41,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-15 07:53:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537452351] [2022-04-15 07:53:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:53:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:41,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {972#true} is VALID [2022-04-15 07:53:41,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 07:53:41,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-15 07:53:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:53:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:41,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-15 07:53:41,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-15 07:53:41,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 07:53:41,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-15 07:53:41,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:53:41,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {972#true} is VALID [2022-04-15 07:53:41,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 07:53:41,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-15 07:53:41,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2022-04-15 07:53:41,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {972#true} is VALID [2022-04-15 07:53:41,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {972#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {972#true} is VALID [2022-04-15 07:53:41,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-15 07:53:41,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-15 07:53:41,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 07:53:41,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-15 07:53:41,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 07:53:41,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 07:53:41,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 07:53:41,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 07:53:41,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 07:53:41,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 2);havoc #t~post6; {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 07:53:41,236 INFO L272 TraceCheckUtils]: 17: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:53:41,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {984#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:53:41,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {984#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {973#false} is VALID [2022-04-15 07:53:41,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-15 07:53:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:41,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537452351] [2022-04-15 07:53:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537452351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:41,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:41,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:53:41,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374170723] [2022-04-15 07:53:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374170723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:41,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:41,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:53:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150106958] [2022-04-15 07:53:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 07:53:41,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:41,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:41,252 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-15 07:53:41,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:53:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:53:41,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:53:41,254 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:48,919 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-15 07:53:51,017 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-15 07:53:53,111 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-15 07:53:55,113 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-15 07:53:57,862 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-15 07:54:01,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:54:03,343 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-15 07:54:05,344 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-15 07:54:08,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:54:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:10,079 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-15 07:54:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:54:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 07:54:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 07:54:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 07:54:10,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-15 07:54:10,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:10,256 INFO L225 Difference]: With dead ends: 72 [2022-04-15 07:54:10,256 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:54:10,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:54:10,257 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:10,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 22.8s Time] [2022-04-15 07:54:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:54:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 07:54:10,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:10,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:54:10,289 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:54:10,290 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:54:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:10,294 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 07:54:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 07:54:10,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:10,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:10,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-15 07:54:10,297 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-15 07:54:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:10,302 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 07:54:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 07:54:10,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:10,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:10,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:10,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:54:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-15 07:54:10,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-15 07:54:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:10,306 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-15 07:54:10,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:10,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 69 transitions. [2022-04-15 07:54:10,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-15 07:54:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:54:10,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:10,511 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:10,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:54:10,512 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-15 07:54:10,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:10,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089695638] [2022-04-15 07:54:10,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:54:10,528 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:54:10,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:54:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 2 times [2022-04-15 07:54:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:10,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598023794] [2022-04-15 07:54:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:10,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:10,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129614339] [2022-04-15 07:54:10,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:54:10,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:10,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:10,553 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-15 07:54:10,554 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-15 07:54:10,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:54:10,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:10,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:54:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:10,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:10,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {1346#true} call ULTIMATE.init(); {1346#true} is VALID [2022-04-15 07:54:10,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1346#true} is VALID [2022-04-15 07:54:10,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1346#true} {1346#true} #102#return; {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {1346#true} call #t~ret7 := main(); {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1346#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {1346#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1346#true} ~cond := #in~cond; {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} assume !(0 == ~cond); {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-15 07:54:10,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1346#true} {1346#true} #82#return; {1346#true} is VALID [2022-04-15 07:54:10,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {1346#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post5 < 2);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 2);havoc #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:54:10,701 INFO L272 TraceCheckUtils]: 19: Hoare triple {1384#(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 + 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)); {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:10,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:10,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1347#false} is VALID [2022-04-15 07:54:10,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-04-15 07:54:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:54:10,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:54:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:10,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598023794] [2022-04-15 07:54:10,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:10,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129614339] [2022-04-15 07:54:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129614339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:10,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:10,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:10,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089695638] [2022-04-15 07:54:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089695638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:10,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:10,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352156856] [2022-04-15 07:54:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:10,704 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-15 07:54:10,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:10,704 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:10,719 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-15 07:54:10,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:54:10,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:54:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:54:10,720 INFO L87 Difference]: Start difference. First operand 51 states and 69 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,425 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-15 07:54:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:54:15,425 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-15 07:54:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:15,425 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 07:54:15,427 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 07:54:15,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-15 07:54:15,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:15,491 INFO L225 Difference]: With dead ends: 73 [2022-04-15 07:54:15,492 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:54:15,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-15 07:54:15,492 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:15,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:54:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:54:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 07:54:15,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:15,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,513 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,513 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,515 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-15 07:54:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-15 07:54:15,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:15,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:15,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-15 07:54:15,516 INFO L87 Difference]: Start difference. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-15 07:54:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,518 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-15 07:54:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-15 07:54:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:15,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:15,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:15,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-04-15 07:54:15,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2022-04-15 07:54:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:15,521 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-04-15 07:54:15,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:15,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 72 transitions. [2022-04-15 07:54:15,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-15 07:54:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:54:15,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:15,585 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:15,600 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-15 07:54:15,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:15,801 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 1 times [2022-04-15 07:54:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:15,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209078221] [2022-04-15 07:54:15,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:54:15,806 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:54:15,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:54:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 2 times [2022-04-15 07:54:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:15,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241432145] [2022-04-15 07:54:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:54:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:15,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:54:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:15,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:54:15,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:54:15,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:54:15,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:54:15,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#(<= ~counter~0 0)} call #t~ret7 := main(); {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:54:15,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:54:15,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:54:15,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:54:15,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:15,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:15,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:15,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1785#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1786#(<= |main_#t~post5| 1)} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume !!(#t~post6 < 2);havoc #t~post6; {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:54:15,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:54:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:54:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241432145] [2022-04-15 07:54:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241432145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:54:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376664332] [2022-04-15 07:54:15,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:54:15,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:15,871 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-15 07:54:15,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:54:15,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:54:15,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:15,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 07:54:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:15,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:15,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #102#return; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret7 := main(); {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:54:15,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #82#return; {1775#true} is VALID [2022-04-15 07:54:15,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1775#true} is VALID [2022-04-15 07:54:15,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#true} is VALID [2022-04-15 07:54:15,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {1775#true} assume !!(#t~post5 < 2);havoc #t~post5; {1775#true} is VALID [2022-04-15 07:54:15,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1775#true} is VALID [2022-04-15 07:54:15,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-15 07:54:15,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 2);havoc #t~post5; {1840#(<= 3 ~counter~0)} is VALID [2022-04-15 07:54:15,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {1840#(<= 3 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1844#(<= 3 |main_#t~post6|)} is VALID [2022-04-15 07:54:15,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {1844#(<= 3 |main_#t~post6|)} assume !!(#t~post6 < 2);havoc #t~post6; {1776#false} is VALID [2022-04-15 07:54:15,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-15 07:54:15,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-15 07:54:15,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:54:15,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:54:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:54:15,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:54:15,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376664332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:15,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:54:15,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-04-15 07:54:15,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:15,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209078221] [2022-04-15 07:54:15,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209078221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:15,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:15,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103838072] [2022-04-15 07:54:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:15,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-15 07:54:15,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:15,999 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), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:16,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:16,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:54:16,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:16,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:54:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:54:16,014 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:23,812 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-04-15 07:54:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:54:23,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-15 07:54:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-15 07:54:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-15 07:54:23,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-15 07:54:23,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:23,880 INFO L225 Difference]: With dead ends: 98 [2022-04-15 07:54:23,880 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 07:54:23,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:54:23,881 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:23,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 170 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:54:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 07:54:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-15 07:54:23,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:23,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:23,920 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:23,920 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:23,922 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-15 07:54:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-15 07:54:23,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:23,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:23,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-15 07:54:23,923 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-15 07:54:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:23,925 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-15 07:54:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-15 07:54:23,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:23,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:23,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:23,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-04-15 07:54:23,927 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 23 [2022-04-15 07:54:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:23,927 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-04-15 07:54:23,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:54:23,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 82 transitions. [2022-04-15 07:54:24,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-04-15 07:54:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 07:54:24,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:24,021 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:24,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:54:24,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:24,221 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-15 07:54:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169320199] [2022-04-15 07:54:24,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:54:24,226 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:54:24,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:54:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 2 times [2022-04-15 07:54:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:24,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336405324] [2022-04-15 07:54:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:54:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:24,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#(<= 0 ~counter~0)} assume true; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2314#(<= 0 ~counter~0)} {2309#true} #102#return; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:54:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:24,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-15 07:54:24,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-15 07:54:24,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-15 07:54:24,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2314#(<= 0 ~counter~0)} #82#return; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:54:24,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#(<= 0 ~counter~0)} assume true; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#(<= 0 ~counter~0)} {2309#true} #102#return; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#(<= 0 ~counter~0)} call #t~ret7 := main(); {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#(<= 0 ~counter~0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {2314#(<= 0 ~counter~0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2309#true} is VALID [2022-04-15 07:54:24,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-15 07:54:24,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-15 07:54:24,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-15 07:54:24,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2314#(<= 0 ~counter~0)} #82#return; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {2314#(<= 0 ~counter~0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2314#(<= 0 ~counter~0)} is VALID [2022-04-15 07:54:24,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {2314#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(<= 1 ~counter~0)} is VALID [2022-04-15 07:54:24,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {2319#(<= 1 ~counter~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2319#(<= 1 ~counter~0)} is VALID [2022-04-15 07:54:24,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {2319#(<= 1 ~counter~0)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2319#(<= 1 ~counter~0)} is VALID [2022-04-15 07:54:24,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {2319#(<= 1 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2320#(<= 2 ~counter~0)} is VALID [2022-04-15 07:54:24,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {2320#(<= 2 ~counter~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2320#(<= 2 ~counter~0)} is VALID [2022-04-15 07:54:24,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {2320#(<= 2 ~counter~0)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2320#(<= 2 ~counter~0)} is VALID [2022-04-15 07:54:24,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2321#(<= 2 |main_#t~post6|)} is VALID [2022-04-15 07:54:24,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {2321#(<= 2 |main_#t~post6|)} assume !!(#t~post6 < 2);havoc #t~post6; {2310#false} is VALID [2022-04-15 07:54:24,328 INFO L272 TraceCheckUtils]: 20: Hoare triple {2310#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2310#false} is VALID [2022-04-15 07:54:24,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {2310#false} ~cond := #in~cond; {2310#false} is VALID [2022-04-15 07:54:24,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {2310#false} assume 0 == ~cond; {2310#false} is VALID [2022-04-15 07:54:24,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-15 07:54:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:54:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:24,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336405324] [2022-04-15 07:54:24,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336405324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:24,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:24,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:54:24,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:24,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169320199] [2022-04-15 07:54:24,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169320199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:24,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:24,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:54:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972823873] [2022-04-15 07:54:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 07:54:24,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:24,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:54:24,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:24,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:54:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:24,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:54:24,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:54:24,344 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:54:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:25,201 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-15 07:54:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:54:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 07:54:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:54:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-15 07:54:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:54:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-15 07:54:25,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2022-04-15 07:54:25,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:25,248 INFO L225 Difference]: With dead ends: 75 [2022-04-15 07:54:25,248 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 07:54:25,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:54:25,249 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:25,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 42 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:54:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 07:54:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-04-15 07:54:25,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:25,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:25,283 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:25,283 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:25,284 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 07:54:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 07:54:25,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:25,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:25,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 07:54:25,285 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 07:54:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:25,286 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 07:54:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 07:54:25,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:25,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:25,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:25,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-15 07:54:25,287 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2022-04-15 07:54:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:25,287 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-15 07:54:25,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:54:25,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-15 07:54:25,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 07:54:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 07:54:25,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:25,326 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:25,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 07:54:25,326 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1181252787, now seen corresponding path program 1 times [2022-04-15 07:54:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029446218] [2022-04-15 07:54:25,331 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:54:25,331 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:54:25,331 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:54:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1181252787, now seen corresponding path program 2 times [2022-04-15 07:54:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:25,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734389728] [2022-04-15 07:54:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:25,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476934278] [2022-04-15 07:54:25,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:54:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:25,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:54:25,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 07:54:25,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:54:25,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:25,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:54:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:25,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:25,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {2624#true} call ULTIMATE.init(); {2624#true} is VALID [2022-04-15 07:54:25,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {2632#(<= ~counter~0 0)} assume true; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2632#(<= ~counter~0 0)} {2624#true} #102#return; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2632#(<= ~counter~0 0)} call #t~ret7 := main(); {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {2632#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {2632#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {2632#(<= ~counter~0 0)} ~cond := #in~cond; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {2632#(<= ~counter~0 0)} assume !(0 == ~cond); {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {2632#(<= ~counter~0 0)} assume true; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2632#(<= ~counter~0 0)} {2632#(<= ~counter~0 0)} #82#return; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2632#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {2632#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2666#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {2666#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {2666#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2676#(<= |main_#t~post5| 1)} is VALID [2022-04-15 07:54:25,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {2676#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {2625#false} is VALID [2022-04-15 07:54:25,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2625#false} is VALID [2022-04-15 07:54:25,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#false} assume !(#t~post6 < 2);havoc #t~post6; {2625#false} is VALID [2022-04-15 07:54:25,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {2625#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)); {2625#false} is VALID [2022-04-15 07:54:25,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {2625#false} ~cond := #in~cond; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {2625#false} assume !(0 == ~cond); {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#false} assume true; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2625#false} {2625#false} #96#return; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L272 TraceCheckUtils]: 24: Hoare triple {2625#false} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#false} ~cond := #in~cond; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {2625#false} assume 0 == ~cond; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2022-04-15 07:54:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:54:25,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:54:25,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2022-04-15 07:54:25,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {2625#false} assume 0 == ~cond; {2625#false} is VALID [2022-04-15 07:54:25,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#false} ~cond := #in~cond; {2625#false} is VALID [2022-04-15 07:54:25,608 INFO L272 TraceCheckUtils]: 24: Hoare triple {2625#false} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {2625#false} is VALID [2022-04-15 07:54:25,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2624#true} {2625#false} #96#return; {2625#false} is VALID [2022-04-15 07:54:25,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-04-15 07:54:25,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {2624#true} assume !(0 == ~cond); {2624#true} is VALID [2022-04-15 07:54:25,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {2624#true} ~cond := #in~cond; {2624#true} is VALID [2022-04-15 07:54:25,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {2625#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)); {2624#true} is VALID [2022-04-15 07:54:25,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#false} assume !(#t~post6 < 2);havoc #t~post6; {2625#false} is VALID [2022-04-15 07:54:25,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2625#false} is VALID [2022-04-15 07:54:25,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {2676#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {2625#false} is VALID [2022-04-15 07:54:25,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {2666#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2676#(<= |main_#t~post5| 1)} is VALID [2022-04-15 07:54:25,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {2666#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {2666#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {2632#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2666#(<= ~counter~0 1)} is VALID [2022-04-15 07:54:25,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {2632#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2624#true} {2632#(<= ~counter~0 0)} #82#return; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-04-15 07:54:25,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {2624#true} assume !(0 == ~cond); {2624#true} is VALID [2022-04-15 07:54:25,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {2624#true} ~cond := #in~cond; {2624#true} is VALID [2022-04-15 07:54:25,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {2632#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2624#true} is VALID [2022-04-15 07:54:25,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {2632#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {2632#(<= ~counter~0 0)} call #t~ret7 := main(); {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2632#(<= ~counter~0 0)} {2624#true} #102#return; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {2632#(<= ~counter~0 0)} assume true; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2632#(<= ~counter~0 0)} is VALID [2022-04-15 07:54:25,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {2624#true} call ULTIMATE.init(); {2624#true} is VALID [2022-04-15 07:54:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:54:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734389728] [2022-04-15 07:54:25,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476934278] [2022-04-15 07:54:25,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476934278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:54:25,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:54:25,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 07:54:25,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029446218] [2022-04-15 07:54:25,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029446218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:25,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:25,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331490857] [2022-04-15 07:54:25,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-15 07:54:25,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:25,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:25,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:25,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:54:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:54:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:54:25,637 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,105 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 07:54:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:54:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-15 07:54:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 07:54:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 07:54:28,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 07:54:28,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:28,137 INFO L225 Difference]: With dead ends: 44 [2022-04-15 07:54:28,137 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 07:54:28,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:54:28,138 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:28,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:54:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 07:54:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 07:54:28,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:28,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,182 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,182 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,183 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 07:54:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 07:54:28,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:28,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:28,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 07:54:28,183 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 07:54:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,184 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 07:54:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 07:54:28,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:28,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:28,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:28,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-15 07:54:28,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2022-04-15 07:54:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:28,185 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-15 07:54:28,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:54:28,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-15 07:54:28,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 07:54:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 07:54:28,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:28,215 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:28,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 07:54:28,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:28,423 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1113182196, now seen corresponding path program 1 times [2022-04-15 07:54:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:28,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [802822600] [2022-04-15 07:54:28,428 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:54:28,428 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:54:28,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:54:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1113182196, now seen corresponding path program 2 times [2022-04-15 07:54:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:28,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787524619] [2022-04-15 07:54:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:28,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:28,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729339010] [2022-04-15 07:54:28,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:54:28,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:28,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:28,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:54:28,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 07:54:28,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:54:28,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:28,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:54:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:28,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:28,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {3014#true} call ULTIMATE.init(); {3014#true} is VALID [2022-04-15 07:54:28,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3014#true} is VALID [2022-04-15 07:54:28,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-04-15 07:54:28,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3014#true} {3014#true} #102#return; {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {3014#true} call #t~ret7 := main(); {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {3014#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {3014#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3014#true} ~cond := #in~cond; {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3014#true} assume !(0 == ~cond); {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3014#true} {3014#true} #82#return; {3014#true} is VALID [2022-04-15 07:54:28,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {3014#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 2);havoc #t~post5; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 2);havoc #t~post5; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post6 < 2);havoc #t~post6; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,599 INFO L272 TraceCheckUtils]: 20: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} 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)); {3014#true} is VALID [2022-04-15 07:54:28,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#true} ~cond := #in~cond; {3014#true} is VALID [2022-04-15 07:54:28,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {3014#true} assume !(0 == ~cond); {3014#true} is VALID [2022-04-15 07:54:28,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-04-15 07:54:28,599 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3014#true} {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #96#return; {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:54:28,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {3052#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:28,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:28,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {3099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3015#false} is VALID [2022-04-15 07:54:28,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {3015#false} assume !false; {3015#false} is VALID [2022-04-15 07:54:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 07:54:28,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:54:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:28,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787524619] [2022-04-15 07:54:28,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:28,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729339010] [2022-04-15 07:54:28,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729339010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:28,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:28,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:28,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:28,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [802822600] [2022-04-15 07:54:28,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [802822600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:28,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:28,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:54:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045724099] [2022-04-15 07:54:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 07:54:28,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:28,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:54:28,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:28,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:54:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:54:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:54:28,618 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:54:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,712 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 07:54:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:54:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 07:54:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:54:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 07:54:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:54:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 07:54:28,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 07:54:28,736 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-15 07:54:28,736 INFO L225 Difference]: With dead ends: 32 [2022-04-15 07:54:28,736 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:54:28,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-15 07:54:28,737 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:28,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:54:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:54:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:54:28,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:28,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:54:28,738 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:54:28,738 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:54:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,738 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:54:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:54:28,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:28,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:28,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:54:28,739 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:54:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:28,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:54:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:54:28,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:28,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:28,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:28,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:54:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:54:28,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-15 07:54:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:28,740 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:54:28,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:54:28,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:54:28,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:54:28,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:28,742 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:54:28,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 07:54:28,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:28,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:54:29,653 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-15 07:54:29,653 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-15 07:54:29,653 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-15 07:54:29,653 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-15 07:54:29,653 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-15 07:54:29,653 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-15 07:54:29,653 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-15 07:54:29,653 INFO L878 garLoopResultBuilder]: At program point L31(lines 31 32) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (and .cse0 .cse1 (<= 1 ~counter~0) .cse2 (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,653 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 61) the Hoare annotation is: true [2022-04-15 07:54:29,653 INFO L878 garLoopResultBuilder]: At program point L52(lines 52 55) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,653 INFO L878 garLoopResultBuilder]: At program point L52-2(lines 20 61) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L44(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0))) (or (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0))) (or (and .cse0 (= main_~h~0 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 (= main_~n~0 main_~r~0) (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,654 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 61) the Hoare annotation is: true [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 56) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post6|) .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (<= |main_#t~post6| 1) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,654 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 30 35) the Hoare annotation is: (let ((.cse0 (<= (+ |main_#t~post5| 1) ~counter~0)) (.cse1 (= main_~p~0 0)) (.cse2 (= main_~n~0 main_~r~0)) (.cse3 (= main_~h~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1 .cse2 .cse3) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 .cse2 (<= 1 ~counter~0) .cse3 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (and .cse0 .cse1 (<= 1 ~counter~0) .cse2) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 (<= 0 ~counter~0) .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 07:54:29,655 INFO L885 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: true [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:54:29,655 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:54:29,655 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:54:29,655 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:54:29,655 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-15 07:54:29,655 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:54:29,656 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-15 07:54:29,656 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-15 07:54:29,656 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-15 07:54:29,656 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:54:29,658 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 07:54:29,658 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:54:29,660 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:54:29,663 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:54:29,697 INFO L163 areAnnotationChecker]: CFG has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:54:29,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:54:29 BoogieIcfgContainer [2022-04-15 07:54:29,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:54:29,705 INFO L158 Benchmark]: Toolchain (without parser) took 69130.02ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 120.3MB in the beginning and 70.7MB in the end (delta: 49.6MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. [2022-04-15 07:54:29,705 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 136.5MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:54:29,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.17ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 143.0MB in the end (delta: -22.9MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-15 07:54:29,705 INFO L158 Benchmark]: Boogie Preprocessor took 20.59ms. Allocated memory is still 169.9MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:54:29,706 INFO L158 Benchmark]: RCFGBuilder took 283.11ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 128.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 07:54:29,706 INFO L158 Benchmark]: TraceAbstraction took 68619.41ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 127.3MB in the beginning and 70.7MB in the end (delta: 56.6MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. [2022-04-15 07:54:29,707 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 136.5MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.17ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 143.0MB in the end (delta: -22.9MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.59ms. Allocated memory is still 169.9MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.11ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 128.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 68619.41ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 127.3MB in the beginning and 70.7MB in the end (delta: 56.6MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 63.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 946 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397 IncrementalHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 353 mSDtfsCounter, 397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 501 PreInvPairs, 590 NumberOfFragments, 843 HoareAnnotationTreeSize, 501 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 724 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((p == 0 && n == r) && 1 <= counter) && h == 0) || !(\old(counter) <= 0)) || ((((p == 0 && n == r) && 0 <= counter) && h == 0) && q == 1)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= \old(cond)) || 1 <= cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:54:29,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...